Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
From MaRDI portal
Publication:975356
DOI10.1007/s10589-009-9265-2zbMath1220.90165OpenAlexW2127012596MaRDI QIDQ975356
Alexey F. Izmailov, Mikhail V. Solodov
Publication date: 9 June 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9265-2
variational problemNewton methodgeneralized equationstabilized sequential quadratic programmingJosephy-Newton methodlinearly constrained Lagrangian method
Related Items
Lipschitz-like mapping and its application to convergence analysis of a variant of Newton's method, Convergence of inexact Newton methods for generalized equations, Metrically Regular Mapping and Its Utilization to Convergence Analysis of a Restricted Inexact Newton-Type Method, A Kantorovich-type convergence analysis of the Newton-Josephy method for solving variational inequalities, Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework, The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization, Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems, Local convergence analysis of an inexact trust-region method for nonsmooth optimization, Newton's method with feasible inexact projections for solving constrained generalized equations, A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems, Newton-type methods: a broader view
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- Applications of second-order cone programming
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Stabilized sequential quadratic programming
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- Strongly Regular Generalized Equations
- A Second-order method for the discrete min-max problem
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- Modifying SQP for Degenerate Problems
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- A quadratically-convergent algorithm for general nonlinear programming problems
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications
