Refining the partition for multifold conic optimization problems
From MaRDI portal
Recommendations
- A complementarity partition theorem for multifold conic systems
- Unifying optimal partition approach to sensitivity analysis in conic optimization
- On the identification of the optimal partition of second order cone optimization problems
- A characterization of partition systems of \(\mathbb R^n\) and application
- On the identification of the optimal partition for semidefinite optimization
Cites work
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 1182578 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1534291 (Why is no real title available?)
- A Condition Number for Multifold Conic Systems
- A complementarity partition theorem for multifold conic systems
- A condition-based algorithm for solving polyhedral feasibility problems
- A mathematical view of interior-point methods in convex optimization
- A polynomial-time algorithm for a class of linear complementarity problems
- A strongly polynomial rounding procedure yielding a maximally complementary solution for P_*() linear complementarity problems
- An exact duality theory for semidefinite programming and its complexity implications
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Condition numbers for polyhedra with real number data
- Facial reduction algorithms for conic optimization problems
- Facial reduction and partial polyhedrality
- Foundations of Optimization
- Linear Inequalities and Related Systems. (AM-38)
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Numerical optimization. Theoretical and practice aspects
- On the identification of the optimal partition of second order cone optimization problems
- Perturbation analysis of second-order cone programming problems
- Strong Duality for Semidefinite Programming
- Strong duality and minimal representations for cone optimization
- Strong duality in conic linear programming: facial reduction and extended duals
- Unifying optimal partition approach to sensitivity analysis in conic optimization
Cited in
(4)- Properties of the complementarity set for the cone of copositive matrices
- A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Partition-Optimization with Schur Convex Sum Objective Functions
This page was built for publication: Refining the partition for multifold conic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151515)
