Skip to main content
Log in

A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

The LP-Newton method for constrained equations, introduced some years ago, has powerful properties of local superlinear convergence, covering both possibly nonisolated solutions and possibly nonsmooth equation mappings. A related globally convergent algorithm, based on the LP-Newton subproblems and linesearch for the equation’s infinity norm residual, has recently been developed. In the case of smooth equations, global convergence of this algorithm to B-stationary points of the residual over the constraint set has been shown, which is a natural result: nothing better should generally be expected in variational settings. However, for the piecewise smooth case only a property weaker than B-stationarity could be guaranteed. In this paper, we develop a procedure for piecewise smooth equations that avoids undesirable accumulation points, thus achieving the intended property of B-stationarity.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bütikofer, S., Klatte, D.: A nonsmooth Newton method with path search and its use in solving C\(^{1,\, 1}\) programs and semi-infinite problems. SIAM J. Optim. 20, 2381–2412 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)

    MATH  Google Scholar 

  3. Daryina, A.N., Izmailov, A.F., Solodov, M.V.: A class of active-set Newton methods for mixed complementarity problems. SIAM J. Optim. 15, 409–429 (2004/2005)

  4. Dreves, A., Facchinei, F., Fischer, A., Herrich, M.: A new error bound result for generalized Nash equilibrium problems and its algorithmic application. Comput. Optim. Appl. 59, 63–84 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dreves, A., Facchinei, F., Kanzow, C., Sagratella, S.: On the solution of the KKT conditions of generalized Nash equilibrium problems. SIAM J. Optim. 21, 1082–1108 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Facchinei, F., Fischer, A., Herrich, M.: A family of Newton methods for nonsmooth constrained systems with nonisolated solutions. Math. Method Oper. Res. 77, 433–443 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Facchinei, F., Fischer, A., Herrich, M.: An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions. Math. Program. 146, 1–36 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM J. Optim. 9, 14–32 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003)

    MATH  Google Scholar 

  10. Fischer, A., Herrich, M., Izmailov, A.F., Solodov, M.V.: Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions. Comput. Optim. Appl. 63, 425–459 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fischer, A., Herrich, M., Izmailov, A.F., Solodov, M.V.: A globally convergent LP-Newton method. SIAM J. Optim. 26, 2012–2033 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gauvin, J., Dubeau, F.: Differential properties of the marginal function in mathematical programming. Math. Program. Stud. 19, 101–119 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ito, K., Kunisch, K.: On a semi-smooth Newton method and its globalization. Math. Program. 118, 347–370 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  14. Izmailov, A.F., Solodov, M.V.: An active set Newton method for mathematical programs with complementarity constraints. SIAM J. Optim. 19, 1003–1027 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Izmailov, A.F., Solodov, M.V.: Newton-Type Methods for Optimization and Variational Problems. Springer Series in Operations Research and Financial Engineering. Springer International Publishing, Switzerland (2014)

    Book  MATH  Google Scholar 

  16. Klatte, D., Kummer, B.: Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications. Kluwer, Dordrecht (2002)

    MATH  Google Scholar 

  17. Williams, A.C.: Marginal values in linear programming. J. Soc. Ind. Appl. Math. 11, 82–94 (1963)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. F. Izmailov.

Additional information

A. Fischer, M. Herrich, and W. Scheck were supported in part by the Volkswagen Foundation. A. F. Izmailov was supported by the Russian Science Foundation Grant 17-11-01168. M. V. Solodov was supported in part by CNPq Grants 303724/2015-3 and PVE 401119/2014-9, and by FAPERJ.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fischer, A., Herrich, M., Izmailov, A.F. et al. A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points. Comput Optim Appl 69, 325–349 (2018). https://doi.org/10.1007/s10589-017-9950-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-017-9950-5

Keywords

Mathematics Subject Classification

Navigation