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

Cites work

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

Cited in

(8)

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

Describes a project that uses

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)