An algorithm for minimizing a differentiable function subject to box constraints and errors

DOI10.1007/BF00934451zbMath0387.65038MaRDI QIDQ1249930

Robert K. Brayton, Jane K. Cullum

Publication date: 1979

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

Related Items

On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems, Proximal methods for the latent group lasso penalty, Enhanced methods for feasible directions for engineering design problems, Some remarks on the symmetric rank-one update, Global convergence of a modified gradient projection method for convex constrained problems, Projected combination direction method for a class of large scale nonlinear programming, Minimization methods for functions on simple sets, Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables

Uses Software

• HSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks on the symmetric rank-one update
• Newton-type methods for unconstrained and linearly constrained optimization
• Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
• A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives
• An alternate implementation of Goldfarb's minimization algorithm
• Optimally conditioned optimization algorithms without line searches
• Quadratic termination properties of Davidon's new variable metric algorithm
• An exact penalty function for nonlinear programming with inequalities
• An efficient method for finding the minimum of a function of several variables without calculating derivatives
• Quasi-Newton Methods and their Application to Function Minimisation
• On a Numerical Instability of Davidon-Like Methods
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• Computational experience with quadratically convergent minimisation methods
• A new approach to variable metric algorithms
• On the Convergence of the Variable Metric Algorithm