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

Inexact-Restoration Method with Lagrangian Tangent Decrease and New Merit Function for Nonlinear Programming

Author

Listed:
  • J. M. Martínez

    (University of Campinas)

Abstract

A new inexact-restoration method for nonlinear programming is introduced. The iteration of the main algorithm has two phases. In Phase 1, feasibility is improved explicitly; in Phase 2, optimality is improved on a tangent approximation of the constraints. Trust regions are used for reducing the step when the trial point is not good enough. The trust region is not centered in the current point, as in many nonlinear programming algorithms, but in the intermediate more feasible point. Therefore, in this semifeasible approach, the more feasible intermediate point is considered to be essentially better than the current point. This is the first method in which intermediate-point-centered trust regions are combined with the decrease of the Lagrangian in the tangent approximation to the constraints. The merit function used in this paper is also new: it consists of a convex combination of the Lagrangian and the nonsquared norm of the constraints. The Euclidean norm is used for simplicity, but other norms for measuring infeasibility are admissible. Global convergence theorems are proved, a theoretically justified algorithm for the first phase is introduced, and some numerical insight is given.

Suggested Citation

  • J. M. Martínez, 2001. "Inexact-Restoration Method with Lagrangian Tangent Decrease and New Merit Function for Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 111(1), pages 39-58, October.
    • Handle: RePEc:spr:joptap:v:111:y:2001:i:1:d:10.1023_a:1017567113614
    DOI: 10.1023/A:1017567113614
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1017567113614
    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:1017567113614?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. J. M. Martínez & E. A. Pilotta, 2000. "Inexact-Restoration Algorithm for Constrained Optimization1," Journal of Optimization Theory and Applications, Springer, vol. 104(1), pages 135-163, January.
    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. J.M. Martínez & B.F. Svaiter, 2003. "A Practical Optimality Condition Without Constraint Qualifications for Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 118(1), pages 117-133, July.
    2. Cândida Silva & M. Monteiro, 2008. "A filter inexact-restoration method for nonlinear programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 16(1), pages 126-146, July.
    3. Wolfgang Schadner, 2021. "Feasible Implied Correlation Matrices from Factor Structures," Papers 2107.00427, arXiv.org.
    4. R. Andreani & E. H. Fukuda & G. Haeser & D. O. Santos & L. D. Secchin, 2021. "On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming," Computational Optimization and Applications, Springer, vol. 79(3), pages 633-648, July.
    5. Wolfgang Schadner & Joshua Traut, 2022. "Estimating Forward-Looking Stock Correlations from Risk Factors," Mathematics, MDPI, vol. 10(10), pages 1-19, May.

    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:111:y:2001:i:1:d:10.1023_a:1017567113614. 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.