Connected level sets, minimizing sets and uniqueness in optimization

DOI10.1007/BF00934339MaRDI QIDQ1148818zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1982

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00934339

zbMATH Keywords

connectednessparametric linear programminguniqueness of minimizersconnected level setsminimizing setsuniqueness in optimization

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3482149 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A generalization of the Frank—Wolfe theorem
• Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functions
• On the continuity of the minimum set of a continuous function
• Quadratic Programming with a Quasiconvex Objective Function
• Subdefinite Matrices and Quadratic Forms

Cited in

(9)

• Continuous approximate solutions in parametric optimization
• Geodesic convexity in nonlinear optimization
• Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
• Best approximation and optimization
• Optimal control of nonconvex sweeping processes with separable endpoints: nonsmooth maximum principle for local minimizers
• A nonsmooth maximum principle for a controlled nonconvex sweeping process
• Generalized connectedness for families of Arcs
• Level sets and the minimal time function of linear control processes
• The level set method of Joó and its use in minimax theory

This page was built for publication: Connected level sets, minimizing sets and uniqueness in optimization

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