The Slacked Unconstrained Minimization Technique for Convex Programming

DOI10.1137/0115046MaRDI QIDQ5574524zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

operations research

Cited in

(16)

• 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
• Nonlinear programming solutions for controlling the vibration pattern of stretched strings
• 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
• 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
• An implementation of some implicit function theorems with applications to sensitivity analysis
• A language for nonlinear programming problems
• Karush-Kuhn-Tucker conditions and Lagrangian approach for improving machine learning techniques: a survey and new developments
• Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
• Theoretical properties and numerical tests of an efficient nonlinear decomposition algorithm

This page was built for publication: The Slacked Unconstrained Minimization Technique for Convex Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5574524)