Pages that link to "Item:Q539648"

The following pages link to On the convergence properties of the projected gradient method for convex optimization (Q539648):

Displaying 29 items.

• Finite termination of inexact proximal point algorithms in Hilbert spaces (Q493258) (← links)
• First-order geometric multilevel optimization for discrete tomography (Q826166) (← links)
• On image reconstruction algorithms for binary electromagnetic geotomography (Q952472) (← 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)
• A cyclic block coordinate descent method with generalized gradient projections (Q1733536) (← links)
• Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
• On the inexact scaled gradient projection method (Q2070333) (← links)
• On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches (Q2084591) (← links)
• Temporal optimization of radiation therapy to heterogeneous tumour populations and cancer stem cells (Q2088009) (← links)
• Hybrid limited memory gradient projection methods for box-constrained optimization problems (Q2111472) (← links)
• Kernel Wiener filtering model with low-rank approximation for image denoising (Q2198252) (← links)
• Full convergence of an approximate projection method for nonsmooth variational inequalities (Q2228645) (← links)
• Piecewise convexity of artificial neural networks (Q2292218) (← links)
• Modified basic projection methods for a class of equilibrium problems (Q2413497) (← links)
• Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
• Inexact gradient projection method with relative error tolerance (Q2696906) (← links)
• On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces (Q2805982) (← links)
• Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems (Q5010048) (← links)
• Learning Multiple Quantiles With Neural Networks (Q5066505) (← links)
• Selecting Regularization Parameters for Nuclear Norm--Type Minimization Problems (Q5095492) (← links)
• Active Set Complexity of the Away-Step Frank--Wolfe Algorithm (Q5124005) (← links)
• Deep unfolding of a proximal interior point method for image restoration (Q5220306) (← links)
• Polar Convolution (Q5231669) (← links)
• The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions (Q5363380) (← links)
• Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection (Q6049278) (← links)
• Paige's algorithm for solving a class of tensor least squares problem (Q6093561) (← links)
• On the stationarity for nonlinear optimization problems with polyhedral constraints (Q6126646) (← links)
• An efficient iterative method for solving a class of constrained tensor least squares problem (Q6131494) (← links)