Pages that link to "Item:Q1821692"

The following pages link to On the convergence of projected gradient processes to singular critical points (Q1821692):

Displaying 33 items.

• Optimality, identifiability, and sensitivity (Q463741) (← links)
• Convergence properties of nonmonotone spectral projected gradient methods (Q557737) (← links)
• Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← 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)
• Linear convergence analysis of the use of gradient projection methods on total variation problems (Q1946623) (← links)
• A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming (Q2067987) (← links)
• On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) (← links)
• LMBOPT: a limited memory method for bound-constrained optimization (Q2146448) (← links)
• Convergence analysis of a projection algorithm for variational inequality problems (Q2301198) (← links)
• Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
• Generic Minimizing Behavior in Semialgebraic Optimization (Q2789611) (← links)
• On the rate of convergence of projected Barzilai–Borwein methods (Q3458822) (← links)
• Ergodic convergence in subgradient optimization (Q4391290) (← links)
• Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis (Q4430668) (← links)
• On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
• Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
• Partial Smoothness and Constant Rank (Q5067431) (← links)
• Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search (Q5080500) (← links)
• The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
• An Extension of the Projected Gradient Method to a Banach Space Setting with Application in Structural Topology Optimization (Q5346505) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)