An interior-point algorithm for semidefinite least-squares problems.
From MaRDI portal
Publication:2148405
DOI10.21136/AM.2021.0217-20OpenAlexW3207224828MaRDI QIDQ2148405
Publication date: 23 June 2022
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21136/am.2021.0217-20
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- A new primal-dual path-following method for convex quadratic programming
- A numerical study of an infeasible primal-dual path-following algorithm for linear programming
- Numerically stable generation of correlation matrices and their factors
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
- A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
- Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- A Dual Approach to Semidefinite Least-Squares Problems
- An Interior-Point Method for Semidefinite Programming
- A penalty method for nonlinear programming
- Least-Squares Covariance Matrix Adjustment
- A relaxed logarithmic barrier method for semidefinite programming