Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
From MaRDI portal
Publication:1584004
DOI10.1007/s101070000170zbMath1017.90111MaRDI QIDQ1584004
Publication date: 3 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
parametric programmingstationary solutionslinear constraintsKojima functionlocal upper Lipschitzlocally Lipschitzian derivativesecond-order stability
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52)
Related Items
Generalization of \(C^{1,1}\) property in infinite dimension ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ Constrained consumptions, Lipschitzian demands, and regular economies ⋮ Implications of the constant rank constraint qualification ⋮ Characterization of the Robust Isolated Calmness for a Class of Conic Programming Problems ⋮ On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization ⋮ On relations of vector optimization results with \(C^{1,1}\) data ⋮ Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming ⋮ A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems ⋮ A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems ⋮ Maximizing strictly convex quadratic functions with bounded perturbations ⋮ On the characterizations of solutions to perturbed l1 conic optimization problem ⋮ Conditioning of linear-quadratic two-stage stochastic optimization problems ⋮ Differentiability properties of functions that are \(\ell \)-stable at a point ⋮ Differentiability properties of \(\ell\)-stable vector functions in infinite-dimensional normed spaces ⋮ On second-order conditions in unconstrained optimization ⋮ Fréchet approach in second-order optimization ⋮ A note on second-order optimality conditions ⋮ Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems ⋮ On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
