The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
type: Item
instance of: scholarly article
title: The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
zbMATH Open document ID: 1285.90065
author: A. S. Kurennoj
author: A. F. Izmailov
author: M. V. Solodov
published in: Set-Valued and Variational Analysis
publication date: 2013-02-21T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6138207
zbMATH Keywords: generalized equation
zbMATH Keywords: \(B\)-differential
zbMATH Keywords: generalized Jacobian
zbMATH Keywords: \(BD\)-regularity
zbMATH Keywords: \(CD\)-regularity
zbMATH Keywords: strong regularity
zbMATH Keywords: semismoothness
zbMATH Keywords: Josephy-Newton method
zbMATH Keywords: SQP
describes a project that uses: SQPlab
describes a project that uses: PLCP
MaRDI profile type: Publication
full work available at URL: s11228-012-0218-z
OpenAlex ID: W2068388303
cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints
cites work: Q4840764
cites work: Local analysis of Newton-type methods for variational inequalities and nonlinear programming
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: Pseudopower expansion of solutions of generalized equations and constrained optimization problems
cites work: Newton's method for generalized equations: a sequential implicit function theorem
cites work: Q3808343
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization
cites work: Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints
cites work: The Theory of 2-Regularity for Mappings with Lipschitzian Derivatives and its Applications to Optimality Conditions
cites work: Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
cites work: A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems
cites work: On second-order sufficient optimality conditions for c 1,1-optimization problems
cites work: Q4026946
cites work: Stability Theory for Parametric Generalized Equations and Variational Inequalities Via Nonsmooth Analysis
cites work: Q5491447
cites work: Nonsmooth Equations: Motivation and Algorithms
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
cites work: Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
cites work: A nonsmooth version of Newton's method
cites work: Strongly Regular Generalized Equations
cites work: Computational schemes for large-scale problems in extended linear- quadratic programming
cites work: Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
cites work: Lifting mathematical programs with complementarity constraints
DOI: 10.1007/S11228-012-0218-Z
description: scientific article; zbMATH DE number 6138207