Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
DOI10.1007/S10589-009-9265-2zbMATH Open1220.90165OpenAlexW2127012596MaRDI QIDQ975356FDOQ975356
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 problemgeneralized equationNewton methodstabilized sequential quadratic programmingJosephy-Newton methodlinearly constrained Lagrangian method
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Superlinear convergence of a stabilized SQP method to a degenerate solution
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- Strongly Regular Generalized Equations
- Applications of second-order cone programming
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Stabilized sequential quadratic programming
- Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
- Modifying SQP for Degenerate Problems
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A quadratically-convergent algorithm for general nonlinear programming problems
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems
- A Second-order method for the discrete min-max problem
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Constraint identification and algorithm stabilization for degenerate nonlinear programs
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
Cited In (12)
- Title not available (Why is that?)
- Newton's method with feasible inexact projections for solving constrained generalized equations
- Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
- A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems
- The Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimization
- Convergence of inexact Newton methods for generalized equations
- A Kantorovich-type convergence analysis of the Newton-Josephy method for solving variational inequalities
- Local convergence analysis of an inexact trust-region method for nonsmooth optimization
- Lipschitz-like mapping and its application to convergence analysis of a variant of Newton's method
- Newton-type methods: a broader view
- Metrically Regular Mapping and Its Utilization to Convergence Analysis of a Restricted Inexact Newton-Type Method
- Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems
Uses Software
This page was built for publication: Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975356)