Interior-point methods
type: Item
instance of: scholarly article
title: Interior-point methods
zbMATH Open document ID: 0967.65078
DOI: 10.1016/S0377-0427(00)00433-7
author: Florian A. Potra
author: Stephen J. Wright
published in: Journal of Computational and Applied Mathematics
publication date: 2001-01-25T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 1556994
zbMATH Keywords: interior-point methods
zbMATH Keywords: linear programming
zbMATH Keywords: algorithms
zbMATH Keywords: convex quadratic programming
zbMATH Keywords: semi-definite programming
zbMATH Keywords: complexity
zbMATH Keywords: monotone linear complementarity
zbMATH Keywords: convex programming
Wikidata QID: Q59411949
MaRDI profile type: Publication
cites work: Average performance of a self-dual interior point algorithm for linear programming
cites work: Probabilistic analysis of optimization algorithms - some aspects from a practical point of view
cites work: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
cites work: Q5588268
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Multiple centrality corrections in a primal-dual method for linear programming
cites work: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
cites work: A new polynomial-time algorithm for linear programming
cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
cites work: Q4206561
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones
cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
cites work: Superlinear convergence of interior-point algorithms for semidefinite programming
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Q4339096
cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming
cites work: Semidefinite Programming
cites work: Q4016509
cites work: Q5691079
cites work: Q4382667
cites work: A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
Recommended article: Q4355913
Recommended article: Interior-point methods for optimization
Recommended article: Interior point methods of mathematical programming
Recommended article: Q4358711
Recommended article: Q4799867
Recommended article: Interior Point Methods for Nonlinear Optimization
Recommended article: Interior-point methods for convex programming
Recommended article: Q4347852
description: scientific article; zbMATH DE number 1556994