Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
From MaRDI portal
Recommendations
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- On the rate of convergence of projected Barzilai-Borwein methods
- scientific article; zbMATH DE number 2221955
- PACBB: a projected adaptive cyclic Barzilai-Borwein method for box constrained optimization
Cites work
- scientific article; zbMATH DE number 2110305 (Why is no real title available?)
- scientific article; zbMATH DE number 2202887 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- scientific article; zbMATH DE number 3345848 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A class of methods for solving large, convex quadratic programs subject to box constraints
- Adaptive two-point stepsize gradient algorithm
- Algorithms for bound constrained quadratic programming problems
- Alternate step gradient method*
- Convex programming in Hilbert space
- Gradient Method with Retards and Generalizations
- Implementing proximal point methods for linear programming
- Inexact spectral projected gradient methods on convex sets
- Modified two-point stepsize gradient methods for unconstrained optimization
- Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the Goldstein-Levitin-Polyak gradient projection method
- On the Identification Property of a Projected Gradient Method
- On the Maximization of a Concave Quadratic Function with Box Constraints
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the asymptotic behaviour of some new gradient methods
- Projected gradient methods for linearly constrained problems
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The conjugate gradient method in extremal problems
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
Cited in
(only showing first 100 items - show all)- Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization
- An adaptive gradient algorithm for large-scale nonlinear bound constrained optimization
- Recovery of the local volatility function using regularization and a gradient projection method
- A nonmonotone filter Barzilai-Borwein method for optimization
- Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis
- Barzilai-Borwein-like methods for the extreme eigenvalue problem
- On projected alternating BB methods for variational inequalities
- Fast projections onto mixed-norm balls with applications
- Equipping the Barzilai-Borwein method with the two dimensional quadratic termination property
- A trust region method based on a new affine scaling technique for simple bounded optimization
- A Barzilai-Borwein type method for minimizing composite functions
- Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
- On the inexact scaled gradient projection method
- Improving ultimate convergence of an augmented Lagrangian method
- A family of spectral gradient methods for optimization
- A modified spectral conjugate gradient projection algorithm for total variation image restoration
- Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization
- Solving bound constrained optimization via a new nonmonotone spectral projected gradient method
- On sparse beamformer design with reverberation
- An algorithm for the fast solution of symmetric linear complementarity problems
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- Shrinking gradient descent algorithms for total variation regularized image denoising
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization
- An active set method for bound-constrained optimization
- PACBB: a projected adaptive cyclic Barzilai-Borwein method for box constrained optimization
- Gradient-based method with active set strategy for \(\ell _1\) optimization
- A gradient method exploiting the two dimensional quadratic termination property
- A modified quasi-Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing.
- Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities
- Several kinds of acceleration techniques for unconstrained optimization first-order algorithms
- A new two-step gradient-type method for large-scale unconstrained optimization
- An effective region force for some variational models for learning and clustering
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Faster gradient descent and the efficient recovery of images
- Sample size selection in optimization methods for machine learning
- Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations
- Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy
- NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods
- Monotone projected gradient methods for large-scale box-constrained quadratic programming
- An accurate active set conjugate gradient algorithm with project search for bound constrained optimization
- Barzilai–Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems
- A barrier method for contact avoiding particles in Stokes flow
- A non-monotone linear search algorithm with mixed direction on Stiefel manifold
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- A new method of moving asymptotes for large-scale linearly equality-constrained minimization
- Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
- The active-set method for nonnegative regularization of linear ill-posed problems
- A hybrid splitting method for smoothing Tikhonov regularization problem
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- A two-phase gradient method for quadratic programming problems with a single linear constraint and bounds on the variables
- Nomonotone spectral gradient method for sparse recovery
- Gradient methods exploiting spectral properties
- A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints
- A structured L-BFGS method and its application to inverse problems
- On efficiency of nonmonotone Armijo-type line searches
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- Riemannian Optimization on the Symplectic Stiefel Manifold
- A computation study on an integrated alternating direction method of multipliers for large scale optimization
- A scalable computational platform for particulate Stokes suspensions
- Projected nonmonotone search methods for optimization with orthogonality constraints
- Prediction-correction method with BB step sizes
- On the quadratic eigenvalue complementarity problem over a general convex cone
- Impulse noise removal by a nonmonotone adaptive gradient method
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- On the application of the spectral projected gradient method in image segmentation
- Algorithms that satisfy a stopping criterion, probably
- Hybrid spectral gradient method for the unconstrained minimization problem
- The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints
- Large correlation analysis
- Combined Newton-gradient method for constrained root-finding in chemical reaction networks
- Gradient descent and fast artificial time integration
- A cyclic projected gradient method
- A non-monotonic method for large-scale non-negative least squares
- The chaotic nature of faster gradient descent methods
- Mixed and hybrid Petrov-Galerkin finite element discretization for optimal control of the wave equation
- An efficient gradient method using the Yuan steplength
- Efficient algorithms for solving condition number-constrained matrix minimization problems
- A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints
- Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems
- On the rate of convergence of projected Barzilai-Borwein methods
- A new projected Barzilai-Borwein method for the symmetric cone complementarity problem
- Bregman iterative algorithms for 2D geosounding inversion
- Duality-based algorithms for total-variation-regularized image restoration
- On \(R\)-linear convergence analysis for a class of gradient methods
- Scaling techniques for gradient projection-type methods in astronomical image deblurring
- On a scalable nonparametric denoising of time series signals
- On the convergence rate of scaled gradient projection method
- Steplength selection in gradient projection methods for box-constrained quadratic programs
- A limited memory steepest descent method
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- Steepest descent method with random step lengths
- An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory
- Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming
- Data-driven distributionally robust risk parity portfolio optimization
- An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices
- Solving the discrete Euler-Arnold equations for the generalized rigid body motion
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- A random active set method for strictly convex quadratic problem with simple bounds
- Projected gradient algorithms for optimization over order simplices
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration
This page was built for publication: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770257)
