Pages that link to "Item:Q4090967"
From MaRDI portal
The following pages link to On the Goldstein-Levitin-Polyak gradient projection method (Q4090967):
Displayed 46 items.
- A conjugate gradient projection algorithm for the traffic assignment problem (Q597403) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← links)
- Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
- On image reconstruction algorithms for binary electromagnetic geotomography (Q952472) (← links)
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization (Q1005145) (← links)
- The effect of perturbations on the convergence rates of optimization algorithms (Q1051402) (← links)
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem (Q1053618) (← links)
- A class of superlinearly convergent projection algorithms with relaxed stepsizes (Q1057626) (← 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)
- Algorithms for a class of nondifferentiable problems (Q1136702) (← links)
- A least-distance programming procedure for minimization problems under linear constraints (Q1170113) (← 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)
- A feasible direction algorithm for convex optimization: Global convergence rates (Q1252156) (← links)
- Computation of the NPMLE of distribution functions for interval censored and truncated data with applications to the Cox model. (Q1274148) (← links)
- Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
- A unified description of iterative algorithms for traffic equilibria (Q1322143) (← links)
- A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods (Q1338143) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- Family of projected descent methods for optimization problems with simple bounds (Q1364228) (← links)
- Coupling the auxiliary problem principle with descent methods of pseudoconvex programming (Q1388858) (← links)
- Computational study of state-of-the-art path-based traffic assignment algorithms (Q1614046) (← links)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
- On finite convergence and constraint identification of subgradient projection methods (Q1802955) (← links)
- On the convergence of projected gradient processes to singular critical points (Q1821692) (← links)
- A parallel descent algorithm for convex programming (Q1908925) (← links)
- Restricted simplicial decomposition for convex constrained problems (Q2366609) (← links)
- The active-set method for nonnegative regularization of linear ill-posed problems (Q2369196) (← links)
- Global convergence of a modified gradient projection method for convex constrained problems (Q2431943) (← links)
- Discrete tomography by convex--concave regularization and D.C. programming (Q2573249) (← links)
- Convergence of the Implicit Filtering Method for Constrained Optimization of Noisy Functions (Q3432717) (← links)
- Prior Learning and Convex-Concave Regularization of Binary Tomography (Q3439196) (← links)
- Computational aspects of two-segment separable programming (Q3664835) (← links)
- Convex quadratic programming with one constraint and bounded variables (Q3771973) (← links)
- Projected gradient methods for linearly constrained problems (Q3773706) (← links)
- Exact penalty algorithm for optimal control problems with control and terminal constraints (Q3797774) (← links)
- (Q4242780) (← links)
- A comparison of numerical methods for optimal shape design problems (Q4242975) (← links)
- Ergodic convergence in subgradient optimization (Q4391290) (← links)
- Restricted Simplicial Decomposition for Symmetric Convex Cost Flow Problems (Q4695015) (← links)
- Optimal Coatings, Bang‐Bang Controls, And Gradient Techniques (Q4721121) (← links)
- Projected Gradient Methods for Nonnegative Matrix Factorization (Q5441321) (← links)
- Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities (Q5959904) (← links)