Hadamard and Strong Well-Posedness for Convex Programs

DOI10.1137/S1052623495286776MaRDI QIDQ4340812zbMATH OpenOpenAlexFDO

Authors J. P. Revalski

Publication date 12 June 1997

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623495286776

zbMATH Keywords

Attouch--Wets convergenceconvex optimization problemswell-posed optimization problem

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 2247730
• Hadamard well-posedness for a set-valued optimization problem
• Convex analysis and optimization in Hadamard spaces
• Hadamard well-posed vector optimization problems
• Convexity and well-posed problems
• Well-posed solvability of convex optimization problems on a differentiable or continuous closed convex set
• On strong and total Lagrange duality for convex optimization problems
• On a problem connected with strongly convex functions
• Well-posedness of approximation and optimization problems for weakly convex sets and functions
• Well-posedness and convexity in vector optimization

Cited in

(29)

• Levitin-Polyak well-posedness of generalized quasivariational inequalities with functional constraints
• Well-posedness for generalized quasi-variational inclusion problems and for optimization problems with constraints
• Levitin-Polyak well-posedness in vector quasivariational inequality problems with functional constraints
• Stable global well-posedness and global strong metric regularity
• Well-posedness for parametric generalized vector quasivariational inequality problems of the minty type
• Well-posedness and generalized metric subregularity with respect to an admissible function
• The strong conical hull intersection property for convex programming
• Typical convex program is very well posed
• Generalized metric subregularity and regularity with respect to an admissible function
• Error bound and well-posedness with respect to an admissible function
• Generalized Levitin-Polyak well-posedness for generalized semi-infinite programs
• Well-posedness for general parametric quasi-variational inclusion problems
• Tykhonov well-posedness for parametric generalized vector equilibrium problems
• Levitin-Polyak well-posedness of vector variational inequality problems with functional constraints
• Well-posedness for parametric strong vector quasi-equilibrium problems with applications
• Well-posedness under relaxed semicontinuity for bilevel equilibrium and optimization problems with equilibrium constraints
• Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints
• Constrained convex optimization problems-well-posedness and stability^*
• Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
• On well-posedness for perturbed quasi-equilibrium and quasi-optimization problems
• Fully stable well-posedness and fully stable minimum with respect to an admissible function
• Almost Every Convex or Quadratic Programming Problem Is Well Posed
• Well-posedness for systems of generalized mixed quasivariational inclusion problems and optimization problems with constraints
• Well-posedness without semicontinuity for parametric quasiequilibria and quasioptimization
• Well-posed optimization problems
• On Hadamard well-posedness of families of Pareto optimization problems
• Levitin-Polyak well-posedness of variational inequality problems with functional constraints
• Levitin-Polyak well-posedness in generalized vector variational inequality problem with functional constraints
• Levitin-Polyak well-posedness for equilibrium problems with functional constraints

This page was built for publication: Hadamard and Strong Well-Posedness for Convex Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340812)