Techniques for exploring the suboptimal set

DOI10.1007/s11081-009-9101-7zbMath1273.65089OpenAlexW2100284154MaRDI QIDQ374684

Stephen P. Boyd, Joëlle Skaf

Publication date: 24 October 2013

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-009-9101-7

zbMATH Keywords

convex optimizationsupport functionellipsoidal approximationssuboptimal set

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10)

Related Items

Global exponential stabilization of nonlinear systems via width time-dependent periodically intermittent smooth control, Bounding duality gap for separable problems with linear constraints, A simple approach for switched control design with control bumps limitation, The Alternating Descent Conditional Gradient Method for Sparse Inverse Problems, H_∞ bumpless transfer for switched LPV systems and its application, Approximate dynamic programming via iterated Bellman inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convexity and well-posed problems
• Geometric algorithms and combinatorial optimization
• Introductory lectures on convex optimization. A basic course.
• Convex analysis and nonlinear optimization. Theory and examples
• Lectures on Modern Convex Optimization
• Warm-Start Strategies in Interior-Point Methods for Linear Programming
• Probing convex polygons with half-planes
• Minimum Covering Ellipses
• Linear Matrix Inequalities in System and Control Theory
• On the Estimation of a Convex Set From Noisy Data on Its Support Function
• A Minimax Chebyshev Estimator for Bounded Error Estimation
• Computation of Minimum-Volume Covering Ellipsoids
• Convex Analysis