Connected level sets, minimizing sets and uniqueness in optimization

DOI10.1007/BF00934339zbMath0452.90075OpenAlexW2009491019MaRDI QIDQ1148818

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)

Related Items (9)

Level sets and the minimal time function of linear control processes ⋮ Continuous approximate solutions in parametric optimization ⋮ Generalized connectedness for families of Arcs ⋮ 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 ⋮ Geodesic convexity in nonlinear optimization ⋮ Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background ⋮ The level set method of Joó and its use in minimax theory ⋮ Best approximation and optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the continuity of the minimum set of a continuous function
• Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functions
• A generalization of the Frank—Wolfe theorem
• Subdefinite Matrices and Quadratic Forms
• Quadratic Programming with a Quasiconvex Objective Function

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