The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization

DOI10.1007/s11228-012-0218-zzbMath1285.90065OpenAlexW2068388303MaRDI QIDQ1938516

Alexey S. Kurennoy, Alexey F. Izmailov, Mikhail V. Solodov

Publication date: 21 February 2013

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11228-012-0218-z

zbMATH Keywords

strong regularitysemismoothnessgeneralized JacobianSQPgeneralized equation\(BD\)-regularity\(CD\)-regularity\(B\)-differentialJosephy-Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Related Items (12)

Perturbed augmented Lagrangian method framework with applications to proximal and smoothed variants ⋮ Stability of metric regularity with set-valued perturbations and application to Newton's method for solving generalized equations ⋮ An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions ⋮ Local convergence analysis of an inexact trust-region method for nonsmooth optimization ⋮ Strongly regular nonsmooth generalized equations ⋮ Newton-type methods: a broader view ⋮ Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions ⋮ Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ Statistical robustness of two-stage stochastic variational inequalities ⋮ Inexact Newton Methods and Dennis--Moré Theorems for Nonsmooth Generalized Equations ⋮ Unnamed Item

Uses Software

• PLCP
• SQPlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
• Lifting mathematical programs with complementarity constraints
• Newton's method for generalized equations: a sequential implicit function theorem
• Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
• Computational schemes for large-scale problems in extended linear- quadratic programming
• Pseudopower expansion of solutions of generalized equations and constrained optimization problems
• A nonsmooth version of Newton's method
• A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems
• Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization
• Nonsmooth Equations: Motivation and Algorithms
• Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
• On Augmented Lagrangian Methods with General Lower-Level Constraints
• On second-order sufficient optimality conditions for c ^1,1-optimization problems
• Strongly Regular Generalized Equations
• Stability Theory for Parametric Generalized Equations and Variational Inequalities Via Nonsmooth Analysis
• Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The Theory of 2-Regularity for Mappings with Lipschitzian Derivatives and its Applications to Optimality Conditions
• Numerical optimization. Theoretical and practical aspects. Transl. from the French

This page was built for publication: The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization