One-step and multistep procedures for constrained minimization problems
From MaRDI portal
Recommendations
- A general method for solving constrained optimization problems
- A dynamical systems approach to constrained minimization
- A note on minimization problems and multistep methods
- scientific article; zbMATH DE number 1552397
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
Cited in
(17)- Constrained optimization: Projected gradient flows
- A note on minimization problems and multistep methods
- One- and multistep discretizations of index 2 differential algebraic systems and their use in optimization
- Using dynamical systems methods to solve minimization problems
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions
- Global convergence of a modified Broyden family method for nonconvex functions
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- A dynamical system method for solving nonlinear ill-posed problems
- On memory gradient method with trust region for unconstrained optimization
- New line search methods for unconstrained optimization
- On an extension of one-shot methods to incorporate additional constraints
- A dynamical systems approach to constrained minimization
- scientific article; zbMATH DE number 2154767 (Why is no real title available?)
- Descent property and global convergence of a new search direction method for unconstrained optimization
- Non monotone backtracking inexact BFGS method for regression analysis
- Dynamical Analysis of Continuous Higher-Order Hopfield Networks for Combinatorial Optimization
- Convergence analysis of a modified BFGS method on convex minimizations
This page was built for publication: One-step and multistep procedures for constrained minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943402)
