Pages that link to "Item:Q3423595"
From MaRDI portal
The following pages link to Cutting plane algorithms for robust conic convex optimization problems (Q3423595):
Displaying 13 items.
- Semi-infinite programming (Q869581) (← links)
- Cascading: An adjusted exchange method for robust conic programming (Q940832) (← links)
- On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
- Cutting plane algorithms for nonlinear semi-definite programming problems with applications (Q1411319) (← links)
- Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization (Q1862178) (← links)
- Comments on: Stability in linear optimization and related topics. A personal tour (Q1939065) (← links)
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems (Q2466781) (← links)
- Optimized cutting plane algorithm for large-scale risk minimization (Q2880969) (← links)
- On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs (Q3675916) (← links)
- Towards a Practical Volumetric Cutting Plane Method for Convex Programming (Q4229486) (← links)
- Exact and overapproximated guarantees for corner cutting avoidance in a multiobstacle environment (Q4556337) (← links)
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization (Q5245362) (← links)
- Benders decomposition approach for the robust network design problem with flow bifurcations (Q5326799) (← links)