An interior-point algorithm for semidefinite least-squares problems.

DOI10.21136/AM.2021.0217-20OpenAlexW3207224828MaRDI QIDQ2148405FDOQ2148405

Ch. Daili, Mohamed Achache

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

zbMATH Keywords

polynomial complexityinterior-point methodsemidefinite least-squares problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51) Semidefinite programming (90C22)

Cites Work

• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Computing the nearest correlation matrix--a problem from finance
• Title not available (Why is that?)
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Numerically stable generation of correlation matrices and their factors
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• A Dual Approach to Semidefinite Least-Squares Problems
• Title not available (Why is that?)
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• Title not available (Why is that?)
• A new primal-dual path-following method for convex quadratic programming
• Least-Squares Covariance Matrix Adjustment
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• A penalty method for nonlinear programming
• Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem
• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• A numerical study of an infeasible primal-dual path-following algorithm for linear programming
• A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
• A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
• A relaxed logarithmic barrier method for semidefinite programming

Cited In (3)

• An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
• An interior-point method for approximate positive semidefinite completions
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma

This page was built for publication: An interior-point algorithm for semidefinite least-squares problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148405)