Interior-point methods: An old and new approach to nonlinear programming
type: Item
instance of: scholarly article
title: Interior-point methods: An old and new approach to nonlinear programming
zbMATH Open document ID: 0887.90164
DOI: 10.1007/BF02614321
author: M. García
published in: Mathematical Programming. Series A. Series B
publication date: 1997-08-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 1053962
zbMATH Keywords: interior point methods
zbMATH Keywords: structural optimization
MaRDI profile type: Publication
cites work: On Long Step Path Following and SUMT for Linear and Quadratic Programming
cites work: Q3690580
cites work: Paths, Trees, and Flowers
cites work: Q5588268
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm
cites work: Multiplier and gradient methods
cites work: A new polynomial-time algorithm for linear programming
cites work: Q4142699
cites work: On the Computational Complexity of Combinatorial Problems
cites work: Q3050157
cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope
cites work: Complexity estimates of some cutting plane methods based on the analytic barrier
cites work: Long-step strategies in interior-point primal-dual methods
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: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
cites work: Q5590418
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Q4339096
cites work: Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
cites work: Q5635266
full work available at URL: https://doi.org/10.1007/bf02614321
OpenAlex ID: W2069337595
description: scientific article; zbMATH DE number 1053962