SDPHA

swMATH2214MaRDI QIDQ14758FDOQ14758

Author name not available (Why is that?)

Described by source

• Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming

Cited In (40)

• Title not available (Why is that?)
• Method of approximate centers for semi-definite programming
• On using Quadratic Interpolation of the Determinant Function to Estimate the Step-Length in a Predictor-Corrector Variant for Semidefinite Programming
• On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence
• A new self-dual embedding method for convex programming
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood
• Title not available (Why is that?)
• Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
• On homogeneous interrior-point algorithms for semidefinite programming
• CSDP, A C library for semidefinite programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• SDPLIB 1.2, a library of semidefinite programming test problems
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
• An easy way to teach interior-point methods.
• On two homogeneous self-dual approaches to linear programming and its extensions.
• The Gauss-Newton direction in semidefinite programming
• Interior Point Methods for Nonlinear Optimization
• Minimal condition number for positive definite Hankel matrices using semidefinite programming
• Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• A computational study of the homogeneous algorithm for large-scale convex optimization
• On the behavior of the homogeneous self-dual model for conic convex optimization
• Title not available (Why is that?)
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• An algorithm for nonsymmetric conic optimization inspired by MOSEK
• A note on the calculation of step-lengths in interior-point methods for semidefinite programming
• On the Complexity of a Practical Interior-Point Method
• Polynomial primal-dual cone affine scaling for semidefinite programming
• Title not available (Why is that?)
• Rank-one LMI approach to stability of 2-D polynomial matrices
• Homogeneous self-dual algorithms for stochastic semidefinite programming
• Interior point methods for second-order cone programming and OR applications
• Conic convex programming and self-dual embedding
• Robust Solutions to Uncertain Semidefinite Programs
• Title not available (Why is that?)

This page was built for software: SDPHA