Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming (Q5437530)

scientific article; zbMATH DE number 5228941

Language	Label	Description	Also known as
English	Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming	scientific article; zbMATH DE number 5228941

Statements

instance of

scholarly article

0 references

title

Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming (English)

0 references

author

Zhaosong Lu

0 references

Renato D. C. Monteiro

0 references

publication date

21 January 2008

0 references

zbMATH Keywords

error bound

0 references

superlinear convergence

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1080/10556780701374633

0 references

cites work

General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems

0 references

Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems

0 references

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

0 references

Limiting behavior of the affine scaling continuous trajectories for linear programming problems

0 references

THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS

0 references

Limiting behavior of weighted central paths in linear programming

0 references

Analytical properties of the central path at boundary point in linear programming

0 references

Two simple proofs for analyticity of the central path in linear programming.

0 references

Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems

0 references

An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem

0 references

Q3965924

0 references

Q4692623

0 references

Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming

0 references

Properties of an Interior-Point Mapping for Mixed Complementarity Problems

0 references

Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem

0 references

On the existence and convergence of the central path for convex programming and some duality results

0 references

On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems

0 references

The analyticity of interior-point-paths at strictly complementary solutions of linear programs

0 references

A unified approach to interior point algorithms for linear complementarity problems: A summary

0 references

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

0 references

On the Convergence of the Central Path in Semidefinite Optimization

0 references

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

0 references

Analyticity of the central path at the boundary point in semidefinite programming

0 references

Initialization in semidefinite programming via a self-dual skew-symmetric embedding

0 references

Interior Point Trajectories in Semidefinite Programming

0 references

Limiting behavior of the central path in semidefinite optimization

0 references

Asymptotic behavior of the central path for a special class of degenerate SDP problems

0 references

On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems

0 references

Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map <i>X</i>1/2<i>SX</i>1/2

0 references

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

0 references

Primal--Dual Path-Following Algorithms for Semidefinite Programming

0 references

Q5691079

0 references

High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems

0 references

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

0 references

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

0 references

Superlinear convergence of interior-point algorithms for semidefinite programming

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

published in

Optimization Methods \& Software

0 references

Identifiers

zbMATH Open document ID

1189.90116

0 references

DOI

10.1080/10556780701374633

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5437530