Pages that link to "Item:Q1403288"

The following pages link to First- and second-order methods for semidefinite programming (Q1403288):

Displaying 20 items.

• Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
• Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
• Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
• Large-scale semidefinite programs in electronic structure calculation (Q868461) (← links)
• A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• A new second-order corrector interior-point algorithm for semidefinite programming (Q1935927) (← links)
• An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood (Q2048820) (← links)
• A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization (Q2050559) (← links)
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations (Q2116587) (← links)
• A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood (Q2221151) (← links)
• An admissible dual internal point method for a linear semidefinite programming problem (Q2261706) (← links)
• A primal-dual interior point method for large-scale free material optimization (Q2350868) (← links)
• Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
• Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: iterative process (Q2672023) (← links)
• Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
• Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
• IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming (Q6498407) (← links)