Pages that link to "Item:Q4090967"

The following pages link to On the Goldstein-Levitin-Polyak gradient projection method (Q4090967):

Displaying 50 items.

• Smooth sparse coding via marginal regression for learning sparse representations (Q309913) (← links)
• Optimal control of the temperature in a catalytic converter (Q316677) (← links)
• Computational enhancements to fluence map optimization for total marrow irradiation using IMRT (Q336465) (← links)
• Computation and application of the paired combinatorial logit stochastic user equilibrium problem (Q336886) (← links)
• A modified gradient projection algorithm for solving the elastic demand traffic assignment problem (Q337015) (← links)
• An active set algorithm for nonlinear optimization with polyhedral constraints (Q341314) (← links)
• Face recognition from caption-based supervision (Q409141) (← links)
• Non-monotone projection gradient method for non-negative matrix factorization (Q429483) (← links)
• An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
• Shape optimization by free-form deformation: existence results and numerical solution for Stokes flows (Q474956) (← links)
• Computing the generalized eigenvalues of weakly symmetric tensors (Q513717) (← links)
• Numerical approach to monotone variational inequalities by a one-step projected reflected gradient method with line-search procedure (Q520863) (← links)
• Convex constrained optimization for large-scale generalized Sylvester equations (Q535294) (← links)
• A conjugate gradient projection algorithm for the traffic assignment problem (Q597403) (← links)
• A Kronecker approximation with a convex constrained optimization method for blind image restoration (Q694158) (← links)
• Sample size selection in optimization methods for machine learning (Q715253) (← links)
• Convergence of one-step projected gradient methods for variational inequalities (Q727225) (← 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)
• Partial spectral projected gradient method with active-set strategy for linearly constrained optimization (Q849145) (← links)
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
• New step lengths in projection method for variational inequality problems (Q902499) (← links)
• On image reconstruction algorithms for binary electromagnetic geotomography (Q952472) (← links)
• Projected gradient method for kernel discriminant nonnegative matrix factorization and the applications (Q985529) (← links)
• Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
• Convergence of a projected gradient method variant for quasiconvex objectives (Q992826) (← links)
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization (Q1005145) (← links)
• Alternative formulations of a combined trip generation, trip distribution, modal split, and trip assignment model (Q1027595) (← links)
• A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
• Cost minimization of a multiple section power cable supplying several remote telecom equipment (Q1039917) (← 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)
• Non-expected route choice model under risk on stochastic traffic networks (Q1642941) (← links)