Local behavior of an iterative framework for generalized equations with nonisolated solutions
From MaRDI portal
Publication:1396815
DOI10.1007/s10107-002-0364-4zbMath1023.90067MaRDI QIDQ1396815
Publication date: 13 July 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0364-4
65K10: Numerical optimization and variational techniques
90C31: Sensitivity, stability, parametric optimization
65H10: Numerical computation of solutions to systems of equations
49J53: Set-valued and variational analysis
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C48: Programming in abstract spaces
Related Items
Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems, A quasi-Newton modified LP-Newton method, On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition, On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces, Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods, Adjusting Dual Iterates in the Presence of Critical Lagrange Multipliers, Local Convergence Analysis of Augmented Lagrangian Methods for Piecewise Linear-Quadratic Composite Optimization Problems, Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity, Local and Global Analysis of Multiplier Methods for Constrained Optimization in Banach Spaces, Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions, Accelerating the modified Levenberg-Marquardt method for nonlinear equations, Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods, Relaxed constant positive linear dependence constraint qualification for disjunctive systems, A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems, A modified Levenberg-Marquardt method for solving system of nonlinear equations, Convergence results of an augmented Lagrangian method using the exponential penalty function, Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function, An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions, Stabilized SQP revisited, On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers, Metric subregularity of order \(q\) and the solving of inclusions, An inexact derivative-free Levenberg-Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions, A Levenberg-Marquardt method with approximate projections, On error bounds and Newton-type methods for generalized Nash equilibrium problems, Iterative solving of generalized equations with calm solution mappings, Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints, Truncated regularized Newton method for convex minimizations, A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming, On the convergence of an inexact Newton-type method, A framework for analyzing local convergence properties with applications to proximal-point algorithms, Combining stabilized SQP with the augmented Lagrangian algorithm, Generalized Nash equilibrium problems and Newton methods, On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions, Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization, Critical multipliers in variational systems via second-order generalized differentiation, Stability of possibly nonisolated solutions of constrained equations, with applications to complementarity and equilibrium problems, A unified approach to error bounds for structured convex optimization problems, On the local and superlinear convergence of a secant modified linear-programming-Newton method, A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property, A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods, Superlinear convergence of a Newton-type algorithm for monotone equations, Active-set Newton methods for mathematical programs with vanishing constraints, The effect of calmness on the solution set of systems of nonlinear equations, A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems, Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems, Subspace-stabilized sequential quadratic programming, Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations, Constrained Lipschitzian error bounds and noncritical solutions of constrained equations, Augmented Lagrangian method for second-order cone programs under second-order sufficiency, Augmented Lagrangian methods for convex matrix optimization problems, On the cost of solving augmented Lagrangian subproblems, Newton-type methods: a broader view, Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition, Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity, Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method, An inexact restoration strategy for the globalization of the sSQP method, A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems, A new relative error criterion for the proximal point algorithm, Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption, A globally convergent proximal Newton-type method in nonsmooth convex optimization, The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework, On the inexactness level of robust Levenberg–Marquardt methods
