scientific article; zbMATH DE number 741122

zbMath0819.65098MaRDI QIDQ4327459

Michael L. Overton, Farid Alizadeh, Jean-Pierre A. Haeberly

Publication date: 6 April 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex optimizationsemidefinite programmingprimal-dual interior-point methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items (28)

An interior-point algorithm for semidefinite least-squares problems. ⋮ Exploiting sparsity in primal-dual interior-point methods for semidefinite programming ⋮ A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming ⋮ A trust region method for solving semidefinite programs ⋮ Linear systems in Jordan algebras and primal-dual interior-point algorithms ⋮ Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs ⋮ Spectral methods for graph bisection problems. ⋮ The \(Q\) method for symmetric cone programming ⋮ A globally convergent filter-type trust region method for semidefinite programming ⋮ A potential reduction algorithm for an extended SDP problem ⋮ The \(Q\) method for second order cone programming ⋮ A polynomial time constraint-reduced algorithm for semidefinite optimization problems ⋮ Robust constrained model predictive control using linear matrix inequalities ⋮ On homogeneous interrior-point algorithms for semidefinite programming ⋮ Implementation of interior point methods for mixed semidefinite and second order cone optimization problems ⋮ Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming ⋮ Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision ⋮ Quasi-Min-Max Model Predictive Control for Image-Based Visual Servoing with Tensor Product Model Transformation ⋮ An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization ⋮ A proximal augmented method for semidefinite programming problems ⋮ Superlinear convergence of interior-point algorithms for semidefinite programming ⋮ Affine scaling algorithm fails for semidefinite programming ⋮ Symmetric primal-dual path-following algorithms for semidefinite programming ⋮ Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function ⋮ A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming ⋮ On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions ⋮ On a commutative class of search directions for linear programming over symmetric cones ⋮ Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗

This page was built for publication: