IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v101y1999i1d10.1023_a1021714926231.html
   My bibliography  Save this article

Primal–Dual–Infeasible Newton Approach for the Analytic Center Deep-Cutting Plane Method

Author

Listed:
  • J. L. Goffin

    (McGill University)

  • F. Sharifi-Mokhtarian

    (McGill University)

Abstract

The convergence and complexity of a primal–dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasibility problems defined by a deep cut separation oracle is studied. The primal–dual–infeasible Newton method is used to generate a primal–dual updating direction. The number of recentering steps is O(1) for cuts as deep as half way to the deepest cut, where the deepest cut is tangent to the primal–dual variant of Dikin's ellipsoid.

Suggested Citation

  • J. L. Goffin & F. Sharifi-Mokhtarian, 1999. "Primal–Dual–Infeasible Newton Approach for the Analytic Center Deep-Cutting Plane Method," Journal of Optimization Theory and Applications, Springer, vol. 101(1), pages 35-58, April.
    • Handle: RePEc:spr:joptap:v:101:y:1999:i:1:d:10.1023_a:1021714926231
    DOI: 10.1023/A:1021714926231
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021714926231
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021714926231?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Michael J. Todd, 1988. "Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 650-659, November.
    2. J. L. Goffin & A. Haurie & J. P. Vial, 1992. "Decomposition and Nondifferentiable Optimization with the Projective Algorithm," Management Science, INFORMS, vol. 38(2), pages 284-302, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    2. Samir Elhedhli & Jean-Louis Goffin, 2005. "Efficient Production-Distribution System Design," Management Science, INFORMS, vol. 51(7), pages 1151-1164, July.
    3. Elhedhli, Samir & Naoum-Sawaya, Joe, 2015. "Improved branching disjunctions for branch-and-bound: An analytic center approach," European Journal of Operational Research, Elsevier, vol. 247(1), pages 37-45.
    4. Laurent Drouet & Alain Haurie & Francesco Moresino & Jean-Philippe Vial & Marc Vielle & Laurent Viguier, 2008. "An oracle based method to compute a coupled equilibrium in a model of international climate policy," Computational Management Science, Springer, vol. 5(1), pages 119-140, February.
    5. C. Beltran-Royo & J.-P. Vial & A. Alonso-Ayuso, 2012. "Semi-Lagrangian relaxation applied to the uncapacitated facility location problem," Computational Optimization and Applications, Springer, vol. 51(1), pages 387-409, January.
    6. Mohammad R. Oskoorouchi & Hamid R. Ghaffari & Tamás Terlaky & Dionne M. Aleman, 2011. "An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application," Operations Research, INFORMS, vol. 59(5), pages 1184-1197, October.
    7. Benno Bueeler & Socrates Kypreos, "undated". "Multiregional Markal-Macro: Introduction of CO Certificate Trade and Solution Concepts," Computing in Economics and Finance 1996 _011, Society for Computational Economics.
    8. Bueler, Benno, 1997. "Solving an equilibrium model for trade of CO2 emission permits," European Journal of Operational Research, Elsevier, vol. 102(2), pages 393-403, October.
    9. Joe Naoum-Sawaya & Samir Elhedhli, 2013. "An interior-point Benders based branch-and-cut algorithm for mixed integer programs," Annals of Operations Research, Springer, vol. 210(1), pages 33-55, November.
    10. Klose, Andreas & Drexl, Andreas, 2001. "Lower bounds for the capacitated facility location problem based on column generation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 544, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Daniel Aloise & Pierre Hansen & Caroline Rocha & Éverton Santi, 2014. "Column generation bounds for numerical microaggregation," Journal of Global Optimization, Springer, vol. 60(2), pages 165-182, October.
    12. Claude Lemaréchal, 2007. "The omnipresence of Lagrange," Annals of Operations Research, Springer, vol. 153(1), pages 9-27, September.
    13. Rustem, Berc & Becker, Robin G. & Marty, Wolfgang, 2000. "Robust min-max portfolio strategies for rival forecast and risk scenarios," Journal of Economic Dynamics and Control, Elsevier, vol. 24(11-12), pages 1591-1621, October.
    14. Gondzio, J. & Sarkissian, R. & Vial, J.-P., 1997. "Using an interior point method for the master problem in a decomposition approach," European Journal of Operational Research, Elsevier, vol. 101(3), pages 577-587, September.
    15. F. Babonneau & O. du Merle & J.-P. Vial, 2006. "Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM," Operations Research, INFORMS, vol. 54(1), pages 184-197, February.
    16. Freund, Robert Michael., 1987. "An analog of Karmarkar's algorithm for inequality constrained linear programs, with a "new" class of projective transformations for centering a polytope," Working papers 1921-87., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    17. Alireza Hosseini & S. M. Hosseini, 2013. "A New Steepest Descent Differential Inclusion-Based Method for Solving General Nonsmooth Convex Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 159(3), pages 698-720, December.
    18. Júlíus Atlason & Marina A. Epelman & Shane G. Henderson, 2008. "Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods," Management Science, INFORMS, vol. 54(2), pages 295-309, February.
    19. G. Y. Zhao, 1999. "Interior-Point Methods with Decomposition for Solving Large-Scale Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 102(1), pages 169-192, July.
    20. Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2020. "Essentials of numerical nonsmooth optimization," 4OR, Springer, vol. 18(1), pages 1-47, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:101:y:1999:i:1:d:10.1023_a:1021714926231. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.