K-K-T multiplier estimates and objective function lower bounds from projective SUMT
type: Item
instance of: scholarly article
title: K-K-T multiplier estimates and objective function lower bounds from projective SUMT
zbMATH Open document ID: 0789.90077
DOI: 10.1016/0167-6377(93)90053-J
author: Roger L. Tobin
author: Terry L. Friesz
author: Nihal J. Mehta
published in: Operations Research Letters
publication date: 1994-06-12T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 519592
zbMATH Keywords: interior point methods
zbMATH Keywords: lower bounds
zbMATH Keywords: projective SUMT differential equations
zbMATH Keywords: barrier multiplier
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: Linear programming and the Newton barrier flow
cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
cites work: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
cites work: Constrained optimization along geodesics
cites work: A Newton-type curvilinear search method for constrained optimization
cites work: A class of methods for unconstrained minimization based on stable numerical integration techniques
cites work: Differential gradient methods
cites work: A Newton-type curvilinear search method for optimization
cites work: Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
cites work: ODE versus SQP methods for constrained optimization
cites work: Q5588268
cites work: Power Series Variants of Karmarkar-Type Algorithms
cites work: An approach to nonlinear programming
cites work: The Projective SUMT Method for Convex Programming
cites work: A general method for solving constrained optimization problems
cites work: A differential equation approach to nonlinear programming
description: scientific article; zbMATH DE number 519592