Almost Every Convex or Quadratic Programming Problem Is Well Posed
From MaRDI portal
Recommendations
- Typical convex program is very well posed
- scientific article; zbMATH DE number 3921349
- Wellposedness and regularization of minimizing sequences in quadratic programming problems in Hilbert space
- Ill-posedness with respect to the solvability in linear optimization
- Hadamard and Strong Well-Posedness for Convex Programs
Cited in
(12)- Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
- Well-posedness under relaxed semicontinuity for bilevel equilibrium and optimization problems with equilibrium constraints
- Well-posedness for general parametric quasi-variational inclusion problems
- Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
- Well-posedness without semicontinuity for parametric quasiequilibria and quasioptimization
- Tykhonov well-posedness for parametric generalized vector equilibrium problems
- Typical convex program is very well posed
- Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems
- Well-posedness in unconstrained polynomial optimization problems
- Generic properties for semialgebraic programs
- Generic well posedness in linear programming
- Stability analysis of partial differential set-valued variational inequalities on Banach spaces
This page was built for publication: Almost Every Convex or Quadratic Programming Problem Is Well Posed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704178)
