Optimization algorithms and point-to-set-maps
From MaRDI portal
Publication:4070640
Cites work
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3253619 (Why is no real title available?)
- scientific article; zbMATH DE number 3263866 (Why is no real title available?)
- scientific article; zbMATH DE number 3307201 (Why is no real title available?)
- scientific article; zbMATH DE number 3310599 (Why is no real title available?)
- scientific article; zbMATH DE number 3363364 (Why is no real title available?)
- scientific article; zbMATH DE number 3400681 (Why is no real title available?)
- Iterative Solution of Nonlinear Optimal Control Problems
- Programmation mathématique convexe
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Validity of a Family of Optimization Methods
Cited in
(13)- Continuousization of the family of point-to-set maps and its applications
- Discussion on the convergence of Rosen's gradient projection method
- Remarks on the convergence of Rosen's gradient projection method
- Global convergence of Rosen's gradient projection method
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- Algorithmes pour suites non convergentes
- Stability of the extreme point set of a polyhedron
- Some notions of nonstationary multistep iteration processes
- Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes
- Implementation of gradient methods by tangential discretization
- A convergence theorem of Rosen’s gradient projection method
- Function of region
- An homage to Joseph-Louis Lagrange and Pierre Huard
This page was built for publication: Optimization algorithms and point-to-set-maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4070640)
