The following pages link to SDPHA (Q14758):
Displaying 40 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- A new self-dual embedding method for convex programming (Q557368) (← links)
- Minimal condition number for positive definite Hankel matrices using semidefinite programming (Q989049) (← links)
- A computational study of the homogeneous algorithm for large-scale convex optimization (Q1273428) (← links)
- Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding (Q1362529) (← links)
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems (Q1572675) (← links)
- On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence (Q1582351) (← links)
- Aspects of semidefinite programming. Interior point algorithms and selected applications (Q1597978) (← links)
- Interior point methods for second-order cone programming and OR applications (Q1888149) (← links)
- Homogeneous self-dual algorithms for stochastic semidefinite programming (Q1935265) (← links)
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization (Q2346399) (← links)
- On the behavior of the homogeneous self-dual model for conic convex optimization (Q2492677) (← links)
- Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood (Q2762830) (← links)
- (Q3102312) (← links)
- (Q3143829) (← links)
- The Gauss-Newton direction in semidefinite programming (Q3146531) (← links)
- Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
- On the Complexity of a Practical Interior-Point Method (Q4210334) (← links)
- Robust Solutions to Uncertain Semidefinite Programs (Q4229471) (← links)
- Method of approximate centers for semi-definite programming (Q4345241) (← links)
- (Q4382667) (← links)
- On homogeneous interrior-point algorithms for semidefinite programming (Q4391293) (← links)
- (Q4400646) (← links)
- (Q4400648) (← links)
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 (Q4504792) (← links)
- CSDP, A C library for semidefinite programming (Q4504795) (← links)
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones (Q4504796) (← links)
- SDPLIB 1.2, a library of semidefinite programming test problems (Q4504799) (← links)
- Conic convex programming and self-dual embedding (Q4525130) (← links)
- (Q4791754) (← links)
- An algorithm for nonsymmetric conic optimization inspired by MOSEK (Q5043851) (← links)
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (Q5275296) (← links)
- (Q5421709) (← links)
- On using Quadratic Interpolation of the Determinant Function to Estimate the Step-Length in a Predictor-Corrector Variant for Semidefinite Programming (Q5851650) (← links)
- On two homogeneous self-dual approaches to linear programming and its extensions. (Q5930742) (← links)
- An easy way to teach interior-point methods. (Q5932020) (← links)
- Rank-one LMI approach to stability of 2-D polynomial matrices (Q5933559) (← links)
- A note on the calculation of step-lengths in interior-point methods for semidefinite programming (Q5961069) (← links)
