A potential reduction algorithm for an extended SDP problem
From MaRDI portal
Publication:1974204
DOI10.1007/BF02903846zbMath0944.90058OpenAlexW1992471341MaRDI QIDQ1974204
Publication date: 26 September 2000
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02903846
Related Items
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization ⋮ A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function ⋮ A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function ⋮ A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO ⋮ Unnamed Item ⋮ Primal-dual interior-point algorithm for convex quadratic semi-definite optimization ⋮ A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization ⋮ On filter-successive linearization methods for nonlinear semidefinite programming
Cites Work
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Unnamed Item
- Unnamed Item
