Techniques for exploring the suboptimal set

DOI10.1007/S11081-009-9101-7zbMATH Open1273.65089OpenAlexW2100284154MaRDI QIDQ374684FDOQ374684

Authors: Joëlle Skaf, Stephen Boyd 

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

Recommendations

• Approximate optimization of convex set functions
• Epsilon efficiency
• An approach to designing numerically implementable algorithms of the \(\epsilon\)-subgradient method
• On \(\varepsilon\)-optimality conditions for convex set-valued optimization problems
• Epsilon-solutions and epsilon-supports

zbMATH Keywords

convex optimizationsupport functionellipsoidal approximationssuboptimal set

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10)

Cites Work

• Title not available (Why is that?)
• Linear Matrix Inequalities in System and Control Theory
• Title not available (Why is that?)
• Introductory lectures on convex optimization. A basic course.
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Convex Analysis
• Geometric algorithms and combinatorial optimization
• Title not available (Why is that?)
• Computation of Minimum-Volume Covering Ellipsoids
• Warm-start strategies in interior-point methods for linear programming
• Title not available (Why is that?)
• Convexity and well-posed problems
• Convex analysis and nonlinear optimization. Theory and examples
• Minimum Covering Ellipses
• Probing convex polygons with half-planes
• On the Estimation of a Convex Set From Noisy Data on Its Support Function
• A Minimax Chebyshev Estimator for Bounded Error Estimation

Cited In (7)

• A simple approach for switched control design with control bumps limitation
• Global exponential stabilization of nonlinear systems via width time-dependent periodically intermittent smooth control
• Bounding duality gap for separable problems with linear constraints
• Approximate dynamic programming via iterated Bellman inequalities
• Title not available (Why is that?)
• The alternating descent conditional gradient method for sparse inverse problems
• H_∞ bumpless transfer for switched LPV systems and its application

This page was built for publication: Techniques for exploring the suboptimal set

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