Family of projected descent methods for optimization problems with simple bounds
From MaRDI portal
Recommendations
- Projected gradient methods for linearly constrained problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints
- Projected combination direction method for a class of large scale nonlinear programming
- An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables
- scientific article; zbMATH DE number 1349196
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Limited Memory Algorithm for Bound Constrained Optimization
- A projected Newton method for minimization problems with nonlinear inequality constraints
- Algorithms for bound constrained quadratic programming problems
- Clipping-off gradient algorithms to compute optimal controls with constrained magnitude
- Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration
- Convergente rate of a penalty-function scheme
- Convex programming in Hilbert space
- Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Matrix conditioning and nonlinear optimization
- Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods
- On the Goldstein-Levitin-Polyak gradient projection method
- On the convergence of sequential minimization algorithms
- On the limited memory BFGS method for large scale optimization
- Partial conjugate gradient methods for a class of optimal control problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Projected gradient methods for linearly constrained problems
- Restart procedures for the conjugate gradient method
- Solution of Optimal Control Problems by a Pointwise Projected Newton Method
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(32)- Interactive dynamic optimization server -- connecting one modelling language with many solvers
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- On a variational approach to optimization of hybrid mechanical systems
- A two-stage active-set algorithm for bound-constrained optimization
- An active set algorithm for nonlinear optimization with polyhedral constraints
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- Convergence properties of nonmonotone spectral projected gradient methods
- Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
- On the hybrid LQ-based control design for linear networked systems
- Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming
- Stochastic optimization on social networks with application to service pricing
- Optimal control methodology for the counter-terrorism strategies: the relaxation based approach
- An active set feasible method for large-scale minimization problems with bound constraints
- Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization
- An approximations based approach to optimal control of switched dynamic systems
- Preface
- Globally convergent DC trust-region methods
- A subspace modified PRP method for large-scale nonlinear box-constrained optimization
- Local convergence analysis of projection-type algorithms: unified approach
- Optimal control for multistage nonlinear dynamic system of microbial bioconversion in batch culture
- A class of projected-search methods for bound-constrained optimization
- A trust region method based on a new affine scaling technique for simple bounded optimization
- A first-order numerical approach to switched-mode systems optimization
- Economic NMPC for averaged infinite horizon problems with periodic approximations
- A feasible direction method for the semidefinite program with box constraints
- Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems
- A decomposition method for Lasso problems with zero-sum constraint
- A novel projected gradient-like method for optimization problems with simple constraints
- Optimal control of impulsive hybrid systems
- Some recent advances in projection-type methods for variational inequalities
- KL-optimum designs: theoretical properties and practical computation
This page was built for publication: Family of projected descent methods for optimization problems with simple bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364228)
