Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems (Q6971050)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems

scientific article; zbMATH DE number 8053283

Language	Label	Description	Also known as
default for all languages	No label defined
English	Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems	scientific article; zbMATH DE number 8053283

Statements

instance of

scholarly article

0 references

title

Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems (English)

0 references

author

Chee-Khian Sim

0 references

published in

Optimization Methods \& Software

0 references

publication date

17 June 2025

0 references

copyright license

Creative Commons Attribution 4.0 International

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results

0 references

A primal-dual interior-point method based on various selections of displacement step for symmetric optimization

0 references

On implementing a primal-dual interior-point method for conic quadratic optimization

0 references

Linear Matrix Inequalities in System and Control Theory

0 references

Q4821526

0 references

A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions

0 references

An Interior-Point Method for Semidefinite Programming

0 references

Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices

0 references

Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs

0 references

A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction

0 references

A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction

0 references

Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming

0 references

Primal--Dual Path-Following Algorithms for Semidefinite Programming

0 references

Local convergence of interior-point algorithms for degenerate monotone LCP

0 references

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

0 references

Primal-Dual Interior-Point Methods for Self-Scaled Cones

0 references

Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems

0 references

\(Q\)-superlinear convergence of the iterates in primal-dual interior-point methods

0 references

A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming

0 references

On homogeneous interrior-point algorithms for semidefinite programming

0 references

Superlinear convergence of interior-point algorithms for semidefinite programming

0 references

An interior point-proximal method of multipliers for linear positive semi-definite programming

0 references

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier

0 references

Superlinear Convergence of an Infeasible Predictor-Corrector Path-Following Interior Point Algorithm for a Semidefinite Linear Complementarity Problem Using the Helmberg–Kojima–Monteiro Direction

0 references

Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence

0 references

Asymptotic behavior of helmberg-kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory

0 references

On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0

0 references

Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)

0 references

Latest Developments in the SDPA Family for Solving Large-Scale SDPs

0 references

On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

0 references

Identifiers

zbMATH Open document ID

1569.90119

0 references

DOI

10.1080/10556788.2024.2400705

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Superlinear convergence of an interior point algorithm on linear semi-definite feasibility problems