Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm
From MaRDI portal
Publication:3581015
DOI10.1137/060650532zbMath1207.49043OpenAlexW1977257062MaRDI QIDQ3581015
David D. W. Yao, Xiaoqing Wang, Shu-Zhong Zhang
Publication date: 16 August 2010
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/51d4824f98b3f4e0cef8cb143bac6d1db25afced
Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Duality theory (optimization) (49N15) Discrete approximations in optimal control (49M25)
Related Items (12)
Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems ⋮ Inverse conic linear programs in Banach spaces ⋮ Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions ⋮ Unnamed Item ⋮ Time-Varying Semidefinite Programming: Path Following a Burer–Monteiro Factorization ⋮ Improving the performance of modular production in the apparel assembly: a mathematical programming approach ⋮ Stochastic separated continuous conic programming: strong duality and a solution method ⋮ Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems ⋮ Duality gap function in infinite dimensional linear programming ⋮ Time-Varying Semidefinite Programs ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ Solving Continuous-Time Linear Programming Problems Based on the Piecewise Continuous Functions
Uses Software
This page was built for publication: Separated Continuous Conic Programming: Strong Duality and an Approximation Algorithm
