Techniques for exploring the suboptimal set
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Minimax Chebyshev Estimator for Bounded Error Estimation
- Computation of Minimum-Volume Covering Ellipsoids
- Convex Analysis
- Convex analysis and nonlinear optimization. Theory and examples
- Convexity and well-posed problems
- Geometric algorithms and combinatorial optimization
- Introductory lectures on convex optimization. A basic course.
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear Matrix Inequalities in System and Control Theory
- Minimum Covering Ellipses
- On the Estimation of a Convex Set From Noisy Data on Its Support Function
- Probing convex polygons with half-planes
- Warm-start strategies in interior-point methods for linear programming
Cited in
(7)- Global exponential stabilization of nonlinear systems via width time-dependent periodically intermittent smooth control
- scientific article; zbMATH DE number 880643 (Why is no real title available?)
- Bounding duality gap for separable problems with linear constraints
- \(H_\infty\) bumpless transfer for switched LPV systems and its application
- A simple approach for switched control design with control bumps limitation
- Approximate dynamic programming via iterated Bellman inequalities
- The alternating descent conditional gradient method for sparse inverse problems
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)