Elimination of bounds in optimization problems by transforming variables
DOI10.1007/BF01589336zbMath0441.90098MaRDI QIDQ3883932
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
upper boundsconstrained optimizationoptimality conditionsunconstrained minimizationbounded variablestransformation of variablesequivalent transformationKuhn-Tucker conditionsnonnegativity constraintssuperlinear rate of convergencemethod of transformationscontinuous second-order partial derivativeslower bounds on the variablesnonlinear objective function of n variables
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Rate of convergence, degree of approximation (41A25)
Related Items (5)
Cites Work
- Unnamed Item
- Elimination of bounds in optimization problems by transforming variables
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- The Convergence of a Class of Double-rank Minimization Algorithms
- A new approach to variable metric algorithms
- The method of steepest descent for non-linear minimization problems
This page was built for publication: Elimination of bounds in optimization problems by transforming variables