Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
type: Item
instance of: scholarly article
title: Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
zbMATH Open document ID: 1278.90447
author: Robert M. Freund
author: Fernando Ordóñez
author: Kim-Chuan Toh
published in: Mathematical Programming. Series A. Series B
publication date: 2007-03-05T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5131077
zbMATH Keywords: behavioral measure
zbMATH Keywords: condition number
zbMATH Keywords: degeneracy
zbMATH Keywords: complementarity
zbMATH Keywords: interior-point method
zbMATH Keywords: semi-definite programming
describes a project that uses: SDPT3
describes a project that uses: SDPLIB
MaRDI profile type: Publication
full work available at URL: s10107-006-0035-y
OpenAlex ID: W1996989380
cites work: Complementarity and nondegeneracy in semidefinite programming
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: Q5690490
cites work: On two measures of problem instance complexity and their correlation with the performance of SeDuMi on second-order cone problems
cites work: Computation of condition numbers for linear programming problems using Peña’s method
cites work: On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization
cites work: Complexity of convex optimization using geometry-based measures and a reference point
cites work: Some characterizations and properties of the ``distance to the ill-posedness'' and the condition measure of a conic linear system
cites work: On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
cites work: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
cites work: Error Bounds and Limiting Behavior of Weighted Paths Associated with the SDP Map X1/2SX1/2
cites work: Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
cites work: Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
cites work: Two properties of condition numbers for convex programs via implicitly defined barrier functions
cites work: Superlinear convergence of interior-point algorithms for semidefinite programming
cites work: Interior-point methods
cites work: Some perturbation theory for linear programming
cites work: Linear programming, complexity theory and elementary functional analysis
cites work: A Characterization of Stability in Linear Programming
cites work: Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
cites work: Solving semidefinite-quadratic-linear programs using SDPT3
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
DOI: 10.1007/S10107-006-0035-Y
Recommended article: Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming
Recommended article: Q4664936
Recommended article: On deviation measures in stochastic integer programming
Recommended article: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
Recommended article: Q4703906
Recommended article: Behavioral Estimation of Mathematical Programming Objective Function Coefficients
Recommended article: A note on the calculation of step-lengths in interior-point methods for semidefinite programming
Recommended article: Q4023787
Recommended article: Implementation of an inexact approach to solving linear semi-infinite programming problems
Recommended article: Semidefinite Relaxations for Integer Programming
description: scientific article; zbMATH DE number 5131077