Pages that link to "Item:Q3779680"

The following pages link to Two-Point Step Size Gradient Methods (Q3779680):

Displaying 50 items.

• An alternating direction method for solving a class of inverse semi-definite quadratic programming problems (Q2515287) (← links)
• Distributed and consensus optimization for non-smooth image reconstruction (Q2516369) (← links)
• An alternating direction approximate Newton algorithm for ill-conditioned inverse problems with application to parallel MRI (Q2516371) (← links)
• A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
• A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations (Q2519689) (← links)
• Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations (Q2564499) (← links)
• New iterative schemes for nonlinear fixed point problems, with applications to problems with bifurcations and incomplete-data problems (Q2567244) (← links)
• Spectral gradient methods for linearly constrained optimization (Q2569199) (← links)
• Convergence of descent method without line search (Q2570691) (← links)
• Differential equations and solution of linear systems (Q2583216) (← links)
• A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
• A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
• A trust region spectral method for large-scale systems of nonlinear equations (Q2629144) (← links)
• Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique (Q2629501) (← links)
• Barzilai and Borwein's method for multiobjective optimization problems (Q2630749) (← links)
• A new approach to improve ill-conditioned parabolic optimal control problem via time domain decomposition (Q2630751) (← links)
• An efficient augmented Lagrangian method with applications to total variation minimization (Q2636603) (← links)
• An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
• A modulus-based nonmonotone line search method for nonlinear complementarity problems (Q2660105) (← links)
• Nonmonotone inexact restoration approach for minimization with orthogonality constraints (Q2661684) (← links)
• An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation (Q2666090) (← links)
• Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains (Q2668766) (← links)
• Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size (Q2669769) (← links)
• A derivative-free multivariate spectral projection algorithm for constrained nonlinear monotone equations (Q2669864) (← links)
• A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization (Q2672727) (← links)
• Implicit steepest descent algorithm for optimization with orthogonality constraints (Q2673531) (← links)
• Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
• A new inertial-based method for solving pseudomonotone operator equations with application (Q2678856) (← links)
• Smoothed quantile regression with large-scale inference (Q2682954) (← links)
• An exact penalty approach for optimization with nonnegative orthogonality constraints (Q2687065) (← links)
• A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula (Q2691372) (← links)
• The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors (Q2693786) (← links)
• A harmonic framework for stepsize selection in gradient methods (Q2701417) (← links)
• Large-Scale Inverse Problems in Imaging (Q2789799) (← links)
• Optimization-based shrinking dimer method for finding transition states (Q2790095) (← links)
• Barzilai–Borwein method with variable sample size for stochastic linear complementarity problems (Q2790891) (← links)
• A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems (Q2804916) (← links)
• An \(\mathcal O(1/{k})\) convergence rate for the variable stepsize Bregman operator splitting algorithm (Q2807288) (← links)
• On the stabilizability of the Burgers equation by receding horizon control (Q2810571) (← links)
• Low-rank spectral optimization via gauge duality (Q2811991) (← links)
• An efficient optimization approach for a cardinality-constrained index tracking problem (Q2815504) (← links)
• A projected gradient method for optimization over density matrices (Q2815508) (← links)
• A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization (Q2815509) (← links)
• A sufficient descent conjugate gradient method and its global convergence (Q2815547) (← links)
• Scaling techniques for \(\epsilon\)-subgradient methods (Q2817840) (← links)
• Projection onto a polyhedron that exploits sparsity (Q2817841) (← links)
• A variable metric forward-backward method with extrapolation (Q2818247) (← links)
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph (Q2833535) (← links)
• Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems (Q2867405) (← links)