Skip to main content
SpringerLink
Log in

Inexact Restoration Methods for Nonlinear Programming: Advances and Perspectives

  • Conference paper
Optimization and Control with Applications

Part of the book series: Applied Optimization ((APOP,volume 96))

Abstract

Inexact Restoration methods have been introduced in the last few years for solving nonlinear programming problems. These methods are related to classical restoration algorithms but also have some remarkable differences. They generate a sequence of generally infeasible iterates with intermediate iterations that consist of inexactly restored points. The convergence theory allows one to use arbitrary algorithms for performing the restoration. This feature is appealing because it allows one to use the structure of the problem in quite opportunistic ways. Different Inexact Restoration algorithms are available. The most recent ones use the trust-region approach. However, unlike the algorithms based on sequential quadratic programming, the trust regions are centered not in the current point but in the inexactly restored intermediate one. Global convergence has been proved, based on merit functions of augmented Lagrangian type. In this survey we point out some applications and we relate recent advances in the theory.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Abadie, J. and Carpentier, J. (1968), Generalization of the Wolfe reduced-gradient method to the case of nonlinear constraints, in Optimization, Edited by R. Fletcher, Academic Press, New York, pp. 37–47.

    Google Scholar 

  • Andreani, R., Dunder, C. and Martínez, J. M. (2001), Order-Value optimization, Technical Report, Institute of Mathematics, University of Campinas, Brazil.

    Google Scholar 

  • Andreani, R. and Martínez, J. M. (2001), On the solution of mathematical programming problems with equilibrium constraints, Mathematical Methods of Operations Research 54, pp. 345–358.

    Article  MathSciNet  Google Scholar 

  • Bielschowsky, R. H. (1996), Nonlinear Programming Algorithms with Dynamic Definition of Near-Feasibility: Theory and Implementations, Doctoral Dissertation, Institute of Mathematics, University of Campinas, Campinas, SP, Brazil, 1996.

    Google Scholar 

  • Bielschowsky, R. H. and Gomes, F. (1998), Dynamical Control of Infeasibility in Constrained Optimization, Contributed Presentation in Optimization 98, Coimbra, Portugal.

    Google Scholar 

  • Birgin, E., Krejić N. and Martínez, J. M. (2001), Solution of bounded nonlinear systems of equations using homotopies with Inexact Restoration, Technical Report, Institute of Mathematics, University of Campinas, Brazil.

    Google Scholar 

  • Drud, A. (1985), CONOPT — A GRG code for large sparse dynamic nonlinear optimization problems, Mathematical Programming 31, pp. 153–191.

    MATH  MathSciNet  Google Scholar 

  • Fletcher, R. and Leyffer, S. (1997), Nonlinear programming without penalty function, Numerical Analysis Report NA/171, University of Dundee.

    Google Scholar 

  • Gomes, F. M., Maciel, M. C. and Martínez, J. M. (1999), Nonlinear programming algorithms using trust regions and augmented Lagrangians with non-monotone penalty parameters, Mathematical Programming 84, pp. 161–200.

    MathSciNet  Google Scholar 

  • Gonzaga, C., Karas, E. and Vanti, M. (2001), A globally convergent filter method for nonlinear programming, Technical Report, Federal University of Santa Catarina, Brazil.

    Google Scholar 

  • Lasdon, L. (1982), Reduced gradient methods, in Nonlinear Optimization 1981, edited by M. J. D. Powell, Academic Press, New York, pp. 235–242.

    Google Scholar 

  • Martínez, J. M. (1997), A Trust-region SLCP model algorithm for nonlinear programming, in Foundations of Computational Mathematics. Edited by F. Cucker and M. Shub. Springer-Verlag, pp. 246–255.

    Google Scholar 

  • Martínez, J. M. (1998), Two-phase model algorithm with global convergence for nonlinear programming, Journal of Optimization Theory and Applications 96, pp. 397–436.

    Article  MATH  MathSciNet  Google Scholar 

  • Martínez, J. M. (2001), Inexact Restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming, Journal of Optimization Theory and Applications 111, pp. 39–58.

    Article  MATH  MathSciNet  Google Scholar 

  • Martínez, J. M. and Pilotta, E. A. (2000), Inexact Restoration algorithm for constrained optimization, Journal of Optimization Theory and Applications 104, pp. 135–163.

    Article  MathSciNet  Google Scholar 

  • Martínez, J. M. and Svaiter, B. F. (2000), A sequential optimality condition for nonlinear programming, Technical Report, Institute of Mathematics, University of Campinas, Brazil.

    Google Scholar 

  • Miele, A., Yuang, H. Y and Heideman, J. C. (1969), Sequential gradient-restoration algorithm for the minimization of constrained functions, ordinary and conjugate gradient version, Journal of Optimization Theory and Applications, Vol. 4, pp. 213–246.

    Article  MathSciNet  Google Scholar 

  • Miele, A., Levy, V. and Cragg, E. (1971), Modifications and extensions of the conjugate-gradient restoration algorithm for mathematical programming problems, Journal of Optimization Theory and Applications, Vol. 7, pp. 450–472.

    Article  Google Scholar 

  • Miele, A., Sims, E. and Basapur, V. (1983), Sequential gradient-restoration algorithm for mathematical programming problems with inequality constraints, Part 1, Theory, Report No. 168, Rice University, Aero-Astronautics.

    Google Scholar 

  • Mukai, H. and Polak, E. (1978), On the use of approximations in algorithm for optimization problems with equality and inequality constraints, SIAM Journal on Numerical Analysis 15, pp. 674–693.

    Article  MathSciNet  Google Scholar 

  • Rom, M. and Avriel, M. (1989), Properties of the sequential gradient-restoration algorithm (SGRA), Part 1: introduction and comparison with related methods, Journal of Optimization Theory and Applications, Vol. 62, pp. 77–98.

    Article  MathSciNet  Google Scholar 

  • Rom, M. and Avriel, M. (1989), Properties of the sequential gradient-restoration algorithm (SGRA), Part 2: convergence analysis, Journal of Optimization Theory and Applications, Vol. 62, pp. 99–126.

    Article  MathSciNet  Google Scholar 

  • Rosen, J. B. (1960), The gradient projection method for nonlinear programming, Part 1, Linear Constraints, SIAM Journal on Applied Mathematics, Vol. 8, pp. 181–217.

    Article  MATH  Google Scholar 

  • Rosen, J. B. (1961), The gradient projection method for nonlinear programming, Part 2, Nonlinear constraints, SIAM Journal on Applied Mathematics, Vol. 9, pp. 514–532.

    Article  Google Scholar 

  • Rosen, J. B. (1978), Two-phase algorithm for nonlinear constraint problems, Nonlinear Programming 3, Edited by O. L. Mangasarian, R. R. Meyer and S. M. Robinson, Academic Press, London and New York, pp. 97–124.

    Google Scholar 

  • Vicente, L. and Calamai, P. (1994), Bilevel and multilevel programming: a bibliography review, Journal of Global Optimization 5, pp. 291–306.

    Article  MathSciNet  Google Scholar 

  • Watson, L. T., Sosonkina, M., Melville, R. C., Morgan, A. P., Walker, H. F. (1997), Algorithm 777. HOMPACK90: A suite of Fortran 90 codes for globally convergent homotopy algorithms, ACM Transactions on Mathematical Software 23, 514–549.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemrtica Aplicada, IMECC-UNICAMP, CP 6065, 13081-970, Campinas SP, Brazil

    José Mario Martinez

  2. Facultad de Matemática, Astronomía y Física, FaMAF, Universidad Nacional de Córdoba, CIEM, Cdad. Universitaria (5000), Córdoba, Argentina

    Elvio A. Pilotta

Authors
  1. José Mario Martinez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elvio A. Pilotta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Hong Kong Polytechnic University, Hong Kong

    Liqun Qi , Koklay Teo  & Xiaoqi Yang ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this paper

Cite this paper

Martinez, J.M., Pilotta, E.A. (2005). Inexact Restoration Methods for Nonlinear Programming: Advances and Perspectives. In: Qi, L., Teo, K., Yang, X. (eds) Optimization and Control with Applications. Applied Optimization, vol 96. Springer, Boston, MA. https://doi.org/10.1007/0-387-24255-4_12

Download citation

Publish with us

Policies and ethics

Search

Navigation