Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
type: Item
instance of: scholarly article
title: Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
zbMATH Open document ID: 1220.90165
published in: Computational Optimization and Applications
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5719096
zbMATH Keywords: Newton method
zbMATH Keywords: Josephy-Newton method
zbMATH Keywords: generalized equation
zbMATH Keywords: variational problem
zbMATH Keywords: linearly constrained Lagrangian method
zbMATH Keywords: stabilized sequential quadratic programming
author: A. F. Izmailov
author: M. V. Solodov
describes a project that uses: SQPlab
describes a project that uses: PLCP
MaRDI profile type: Publication
full work available at URL: s10589-009-9265-2
OpenAlex ID: W2127012596
cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
cites work: A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
cites work: Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications
cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
cites work: Q3690580
cites work: Q4840764
cites work: Local analysis of Newton-type methods for variational inequalities and nonlinear programming
cites work: Q4503250
cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
cites work: On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
cites work: Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
cites work: Local behavior of an iterative framework for generalized equations with nonisolated solutions
cites work: A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
cites work: A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
cites work: Stabilized sequential quadratic programming
cites work: A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
cites work: Q3943431
cites work: Q4517115
cites work: Applications of second-order cone programming
cites work: A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
cites work: Q4324980
cites work: A Second-order method for the discrete min-max problem
cites work: A quadratically-convergent algorithm for general nonlinear programming problems
cites work: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
cites work: Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
cites work: Strongly Regular Generalized Equations
cites work: On the Sequential Quadratically Constrained Quadratic Programming Methods
cites work: A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
cites work: Superlinear convergence of a stabilized SQP method to a degenerate solution
cites work: Modifying SQP for Degenerate Problems
cites work: Constraint identification and algorithm stabilization for degenerate nonlinear programs
DOI: 10.1007/S10589-009-9265-2
description: scientific article; zbMATH DE number 5719096