Trust region affine scaling algorithms for linearly constrained convex and concave programs
type: Item
instance of: scholarly article
title: Trust region affine scaling algorithms for linearly constrained convex and concave programs
zbMATH Open document ID: 0901.90166
DOI: 10.1007/BF01581170
author: Renato D. C. Monteiro
author: Yanhui Wang
published in: Mathematical Programming. Series A. Series B
publication date: 1998-03-11T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1127729
zbMATH Keywords: interior point method
zbMATH Keywords: trust region affine scaling algorithm
zbMATH Keywords: linearly constrained convex or concave programming
describes a project that uses: GQTPAR
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: Limiting behavior of the affine scaling continuous trajectories for linear programming problems
cites work: A variation on Karmarkar’s algorithm for solving linear programming problems
cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
cites work: The trust region affine interior point algorithm for convex and nonconvex quadratic programming
cites work: Q5583564
cites work: Q4187574
cites work: Q4226179
cites work: Computing Optimal Locally Constrained Steps
cites work: Q4209438
cites work: A continuous approach to inductive inference
cites work: A new polynomial-time algorithm for linear programming
cites work: An interior point algorithm to solve computationally difficult set covering problems
cites work: A method for the solution of certain non-linear problems in least squares
cites work: An Algorithm for Least-Squares Estimation of Nonlinear Parameters
cites work: The Affine Scaling Algorithm Fails for Stepsize 0.999
cites work: Boundary Behavior of Interior Point Algorithms in Linear Programming
cites work: Computational experience with a dual affine variant of Karmarkar's method for linear programming
cites work: Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming
cites work: Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming
cites work: A simplified global convergence proof of the affine scaling algorithm
cites work: Superlinear primal-dual affine scaling algorithms for LCP
cites work: Computing a Trust Region Step
cites work: Q4347852
cites work: A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
cites work: A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
cites work: A convergence analysis for a convex version of Dikin's algorithm
cites work: On the convergence of the affine-scaling algorithm
cites work: Global convergence of the affine scaling methods for degenerate linear programming problems
cites work: Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
cites work: Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
cites work: Superlinear convergence of the affine scaling algorithm
cites work: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
cites work: A modification of Karmarkar's linear programming algorithm
cites work: On affine scaling algorithms for nonconvex quadratic programming
cites work: An extension of Karmarkar's projective algorithm for convex quadratic programming
full work available at URL: https://doi.org/10.1007/bf01581170
OpenAlex ID: W2157036632
description: scientific article; zbMATH DE number 1127729