Almost Every Convex or Quadratic Programming Problem Is Well Posed
From MaRDI portal
Publication:5704178
DOI10.1287/moor.1030.0080zbMath1082.49031OpenAlexW2100687784MaRDI QIDQ5704178
Roberto Lucchetti, Alexander D. Ioffe, Julian Petrov Revalski
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1030.0080
Lebesgue measure zerowell-posed problemporous setBaire category(quasi)-convex problemquadratic mathematical programming problem
Convex programming (90C25) Sensitivity, stability, well-posedness (49K40) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
Well-posedness under relaxed semicontinuity for bilevel equilibrium and optimization problems with equilibrium constraints, Generic Properties for Semialgebraic Programs, Unnamed Item, Well-posedness for general parametric quasi-variational inclusion problems, Well-posedness without semicontinuity for parametric quasiequilibria and quasioptimization, Levitin-Polyak well-posedness for lexicographic vector equilibrium problems, Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems, Well-Posedness in Unconstrained Polynomial Optimization Problems, Unnamed Item, Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
