Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
From MaRDI portal
Publication:2116019
Abstract: This paper mainly concerns with the primal superlinear convergence of the quasi-Newton sequential quadratic programming (SQP) method for piecewise linear-quadratic composite optimization problems. We show that the latter primal superlinear convergence can be justified under the noncriticality of Lagrange multipliers and a version of the Dennis-More condition. Furthermore, we show that if we replace the noncriticality condition with the second-order sufficient condition, this primal superlinear convergence is equivalent with an appropriate version of the Dennis-More condition. We also recover Bonnans' result in [1] for the primal-dual superlinear of the basic SQP method for this class of composite problems under the second-order sufficient condition and the uniqueness of Lagrange multipliers. To achieve these goals, we first obtain an extension of the reduction lemma for convex Piecewise linear-quadratic functions and then provide a comprehensive analysis of the noncriticality of Lagrange multipliers for composite problems. We also establish certain primal estimates for KKT systems of composite problems, which play a significant role in our local convergence analysis of the quasi-Newton SQP method.
Recommendations
- Sharp primal superlinear convergence results for some Newtonian methods for constrained optimization
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- scientific article; zbMATH DE number 1329062
- Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION
Cites work
- scientific article; zbMATH DE number 1099075 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1568999 (Why is no real title available?)
- A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
- A proximal method for composite minimization
- Amenable functions in optimization
- An Implicit-Function Theorem for a Class of Nonsmooth Functions
- Critical multipliers in variational systems via second-order generalized differentiation
- Criticality of Lagrange multipliers in extended nonlinear optimization
- Criticality of Lagrange multipliers in variational systems
- Error bounds, quadratic growth, and linear convergence of proximal methods
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- Implicit Functions and Solution Mappings
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Newton-Type Methods for Optimization and Variational Problems
- Newton-type methods: a broader view
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On analytical and computational stability of critical Lagrange multipliers
- On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
- Parabolic regularity in geometric variational analysis
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Proto-differentiability of set-valued mappings and its applications in optimization
- Second-Order Optimality Conditions in Nonlinear Programming Obtained by Way of Epi-Derivatives
- Second-order epi-derivatives of composite functionals
- Sharp primal superlinear convergence results for some Newtonian methods for constrained optimization
- Some continuity properties of polyhedral multifunctions
- Stabilized SQP revisited
- Strongly Regular Generalized Equations
- Superlinear convergence of the sequential quadratic method in constrained optimization
- The multiproximal linearization method for convex composite problems
- Twice epi-differentiability of extended-real-valued functions with applications in composite optimization
- Variational analysis and applications
- Variational analysis of regular mappings. Theory and applications
Cited in
(7)- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- Role of subgradients in variational analysis of polyhedral functions
- A Chain Rule for Strict Twice Epi-Differentiability and Its Applications
- Isolated calmness of perturbation mappings and superlinear convergence of Newton-type methods
- scientific article; zbMATH DE number 7733432 (Why is no real title available?)
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- Sharp primal superlinear convergence results for some Newtonian methods for constrained optimization
This page was built for publication: Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116019)
