A Barrier Method for Large-Scale Constrained Optimization

DOI10.1287/ijoc.5.1.40zbMath0774.90078OpenAlexW2140142240MaRDI QIDQ4202470

Ariela Sofer, Stephen G. Nash

Publication date: 31 August 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.5.1.40

zbMATH Keywords

inequality constraintslogarithmic barrier methodNewton-type algorithms

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A discussion of probability functions and constraints from a variational perspective ⋮ Some properties of the Hessian of the logarithmic barrier function ⋮ A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds ⋮ Two Classes of Smooth Objective Penalty Functions for Constrained Problems ⋮ Large signal-to-noise ratio quantification in MLE for ARARMAX models ⋮ Computing Multiple Solutions of Topology Optimization Problems ⋮ A survey of truncated-Newton methods