Examples of ill-behaved central paths in convex optimization
type: Item
instance of: scholarly article
title: Examples of ill-behaved central paths in convex optimization
zbMATH Open document ID: 1079.90099
published in: Mathematical Programming. Series A. Series B
publication date: 2005-05-12T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 49M30
zbMATH DE Number: 2168041
zbMATH Keywords: Central path
zbMATH Keywords: Convex optimization
zbMATH Keywords: Interior point algorithm
zbMATH Keywords: Nonlinear programming
zbMATH Keywords: Penalty function methods
author: J. Ch. Gilbert
author: C. C. Gonzaga
author: Elizabeth W. Karas
describes a project that uses: TRICE
MaRDI profile type: Publication
full work available at URL: s10107-003-0460-0
OpenAlex ID: W2009666506
cites work: Limiting behavior of the affine scaling continuous trajectories for linear programming problems
cites work: Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
cites work: A trust region method based on interior point techniques for nonlinear programming.
cites work: Smoothing methods for convex inequalities and linear complementarity problems
cites work: A class of smoothing functions for nonlinear and mixed complementarity problems
cites work: Q4945769
cites work: Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
cites work: Q5588268
cites work: Q5511041
cites work: Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
cites work: Q3840106
cites work: Path-Following Methods for Linear Programming
cites work: Interior point techniques in optimization. Complementarity, sensitivity and algorithms
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
cites work: An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
cites work: Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
cites work: On the existence and convergence of the central path for convex programming and some duality results
cites work: Q4324980
cites work: Q4339096
cites work: Interior point methods of mathematical programming
cites work: An interior-point algorithm for nonconvex nonlinear programming
cites work: A primal-dual interior point method whose running time depends only on the constraint matrix
cites work: Q5202840
cites work: Q5691079
DOI: 10.1007/S10107-003-0460-0
description: scientific article; zbMATH DE number 2168041