Generic well-posedness in mathematical programming

MaRDI QIDQ2720938zbMATH OpenFDO

Authors Alexander D. Ioffe, J. P. Revalski, Roberto Lucchetti

Publication date 1 July 2001

Published in Doklady Bolgarskoĭ Akademii Nauk (Search for Journal in Brave)

zbMATH Keywords

convex programmingminimization

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Review text

This paper deals with generic well-posedness of mathematical programming problems such as minimizing an objective function under inequality and equality constraints. A general variational principle is provided for studying such problems. Several important classes of mathematical programming problems are considered as well.

Recommendations

• A variational principle for problems with functional constraints
• Generic well-posedness in minimization problems
• Generic well-posedness of minimization problems with mixed smooth constraints
• Generic well-posedness of minimization problems with mixed continuous constraints.
• Variational Principles and Well-Posedness in Optimization and Calculus of Variations

Cited in

(10)

• Generic well-posedness of minimization problems with mixed continuous constraints.
• Generic well-posedness in minimization problems
• Generic well-posedness of minimization problems with mixed smooth constraints
• Typical convex program is very well posed
• A variational principle for problems with functional constraints
• Generic well posedness in linear programming
• scientific article; zbMATH DE number 4113280 (Why is no real title available?)
• Generic well‐posedness of optimization problems in topological spaces
• scientific article; zbMATH DE number 1568988 (Why is no real title available?)
• Genericity of well-posedness, perturbations and smooth variational principles

This page was built for publication: Generic well-posedness in mathematical programming

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