Pages that link to "Item:Q1821692"
From MaRDI portal
The following pages link to On the convergence of projected gradient processes to singular critical points (Q1821692):
Displayed 17 items.
- Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← links)
- Convergence properties of trust region methods for linear and convex constraints (Q922951) (← links)
- A projected Newton method in a Cartesian product of balls (Q1093537) (← links)
- A projected Newton method for minimization problems with nonlinear inequality constraints (Q1095798) (← links)
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities (Q1101344) (← links)
- Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
- Solution of projection problems over polytopes (Q1185491) (← links)
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288) (← links)
- Minimum principle sufficiency (Q1198327) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- Interior point methods for optimal control of discrete time systems (Q1321328) (← links)
- Some recent advances in projection-type methods for variational inequalities (Q1872978) (← links)
- Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
- Ergodic convergence in subgradient optimization (Q4391290) (← links)
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis (Q4430668) (← links)
- A potential reduction algorithm for linearly constrained convex programming (Q5953365) (← links)