Generic well-posedness of minimization problems without compactness assumptions

MaRDI QIDQ3515451zbMATH OpenFDO

Authors Alexander J. Zaslavski

Publication date 29 July 2008

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Dynamic programming (90C39) Sensitivity, stability, well-posedness (49K40) Programming in abstract spaces (90C48)

Recommendations

• On a generic existence result in optimization
• scientific article; zbMATH DE number 3921349
• scientific article; zbMATH DE number 2059554
• Generic well-posedness of symmetric minimization problems
• scientific article; zbMATH DE number 4050400

Cited in

(13)

• scientific article; zbMATH DE number 2059554 (Why is no real title available?)
• Generic well-posedness of minimization problems with mixed continuous constraints.
• Generic well-posedness of minimization problems with mixed smooth constraints
• scientific article; zbMATH DE number 3877859 (Why is no real title available?)
• scientific article; zbMATH DE number 3859843 (Why is no real title available?)
• Generic existence of solutions and generic well-posedness of optimization problems
• Measures of noncompactness and well-posed minimization problems
• Existence of solutions of a vector optimization problem with a generic lower semicontinuous objective function
• Generic well-posedness of constrained variational problems without convexity assumptions
• Generic well-posedness of symmetric minimization problems
• scientific article; zbMATH DE number 3921349 (Why is no real title available?)
• On a genetic existence result for a class of optimization problems
• Density of the set of local minimizers for a generic cost function

This page was built for publication: Generic well-posedness of minimization problems without compactness assumptions

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