Elimination of bounds in optimization problems by transforming variables

DOI10.1007/BF01589336MaRDI QIDQ3883932zbMATH OpenFDO

Authors F. S. Sisser

Publication date 1981

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01589336

zbMATH Keywords

bounded variablesconstrained optimizationcontinuous second-order partial derivativesequivalent transformationKuhn-Tucker conditionslower bounds on the variablesmethod of transformationsnonlinear objective function of n variablesnonnegativity constraintsoptimality conditionssuperlinear rate of convergencetransformation of variablesunconstrained minimizationupper bounds

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites work

• A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
• A new approach to variable metric algorithms
• Elimination of bounds in optimization problems by transforming variables
• scientific article; zbMATH DE number 3529352 (Why is no real title available?)
• The Convergence of a Class of Double-rank Minimization Algorithms
• The method of steepest descent for non-linear minimization problems

Cited in

(5)

• Aspects of mathematical modelling related to optimization
• A modified Newton's method for minimizing factorable functions
• Minimization methods for functions on simple sets
• Methods of minimization of functions on a sphere and their applications
• Elimination of bounds in optimization problems by transforming variables

This page was built for publication: Elimination of bounds in optimization problems by transforming variables

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