The Slacked Unconstrained Minimization Technique for Convex Programming
From MaRDI portal
Publication:5574524
DOI10.1137/0115046zbMath0183.22801OpenAlexW2081956522MaRDI QIDQ5574524
Garth P. McCormick, Anthony V. Fiacco
Publication date: 1967
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0115046
Related Items
A language for nonlinear programming problems, Optimization of electrical networks using nonlinear programming, Rates of convergence for a method of centers algorithm, Interior point penalty functions for constrained minimization, A generalization of Lagrange's method of undetermined multipliers using zero-zone functionals, Approximation methods for the unconstrained optimization, Approximate Karush-Kuhn-Tucker condition in multiobjective optimization, Nonlinear programming solutions for controlling the vibration pattern of stretched strings, An implementation of some implicit function theorems with applications to sensitivity analysis, A proof of the convergence of the Kelley-Bryson penalty function technique for state-constrained control problems, Penalty methods for mathematical programming in \(E^n\) with general constraint sets, Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm, Balance function for the optimal control problem, Some representation theorems for functions and sets and their application to nonlinear programming, On infinite-dimensional convex programs