An algorithm for minimizing a differentiable function subject to box constraints and errors
From MaRDI portal
Publication:1249930
DOI10.1007/BF00934451zbMATH Open0387.65038MaRDI QIDQ1249930FDOQ1249930
Authors: Robert K. Brayton, Jane K. Cullum 
Publication date: 1979
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Cites Work
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Title not available (Why is that?)
- A new approach to variable metric algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Newton-type methods for unconstrained and linearly constrained optimization
- Title not available (Why is that?)
- An exact penalty function for nonlinear programming with inequalities
- Quasi-Newton Methods and their Application to Function Minimisation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimally conditioned optimization algorithms without line searches
- Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- On a Numerical Instability of Davidon-Like Methods
- On the Convergence of the Variable Metric Algorithm
- Quadratic termination properties of Davidon's new variable metric algorithm
- Computational experience with quadratically convergent minimisation methods
- An alternate implementation of Goldfarb's minimization algorithm
- Title not available (Why is that?)
- Some remarks on the symmetric rank-one update
- A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives
Cited In (8)
- Global convergence of a modified gradient projection method for convex constrained problems
- Some remarks on the symmetric rank-one update
- Projected combination direction method for a class of large scale nonlinear programming
- Proximal methods for the latent group lasso penalty
- Minimization methods for functions on simple sets
- On the performance of a new symmetric rank-one method with restart for solving unconstrained optimization problems
- Enhanced methods for feasible directions for engineering design problems
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
Uses Software
This page was built for publication: An algorithm for minimizing a differentiable function subject to box constraints and errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249930)
