First- and second-order methods for semidefinite programming
From MaRDI portal
Publication:1403288
DOI10.1007/s10107-003-0451-1zbMath1035.90057OpenAlexW2133184112MaRDI QIDQ1403288
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0451-1
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood, On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems, Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems, Large-scale semidefinite programs in electronic structure calculation, Strong duality and minimal representations for cone optimization, Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process, A new second-order corrector interior-point algorithm for semidefinite programming, An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem, Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood, Global optimality conditions and optimization methods for polynomial programming problems, A parallel interior point decomposition algorithm for block angular semidefinite programs, Local minima and convergence in low-rank semidefinite programming, An admissible dual internal point method for a linear semidefinite programming problem, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, Faster, but weaker, relaxations for quadratically constrained quadratic programs, An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood, A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization, A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization, A primal-dual interior point method for large-scale free material optimization, Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
Uses Software
