Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
From MaRDI portal
Publication:923998
DOI10.1016/j.na.2009.01.241zbMath1179.65074OpenAlexW2038095899MaRDI QIDQ923998
Publication date: 24 July 2009
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2009.01.241
iteration boundinterior-point algorithmconvex quadratic semi-definite optimizationlarge- and small-update methods
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)
Related Items (17)
A method for weighted projections to the positive definite cone ⋮ Gradient methods and conic least-squares problems ⋮ A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization ⋮ A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming ⋮ 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 new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO ⋮ Unnamed Item ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP ⋮ Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term ⋮ A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization ⋮ A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions ⋮ Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization ⋮ A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function ⋮ Primal-dual interior-point algorithms for convex quadratic circular cone optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Uniform LP duality for semidefinite and semi-infinite programming
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Self-regular functions and new search directions for linear and semidefinite optimization
- A potential reduction algorithm for an extended SDP problem
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- Duality for semi-definite and semi-infinite programming
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Perfect duality in semi-infinite and semidefinite programming
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
This page was built for publication: Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
