Cutting plane algorithms for robust conic convex optimization problems
From MaRDI portal
(Redirected from Publication:3423595)
Recommendations
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
- A sequential cutting plane algorithm for solving convex NLP problems
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
Cites work
- An implementation of a discretization method for semi-infinite programming
- Applications of second-order cone programming
- Connections between generalized, inexact and semi-infinite linear programming
- Direct theorems in semi-infinite convex programming
- Discretization methods for the solution of semi-infinite programming problems
- Duality for inexact linear programming problems∗
- Duality for inexact semi-infinite linear programming
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1845876 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Robust convex optimization
- Second-order cone programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite Programming
- Some generalization of inexact linear programming
- Strong duality for inexact linear programming
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
Cited in
(13)- On global optimality conditions and cutting plane algorithms
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications
- Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization
- Comments on: Stability in linear optimization and related topics. A personal tour
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- Optimized cutting plane algorithm for large-scale risk minimization
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming
- Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Semi-infinite programming
- Cascading: An adjusted exchange method for robust conic programming
This page was built for publication: Cutting plane algorithms for robust conic convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423595)
