Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming

From MaRDI portal
Publication:1770257

DOI10.1007/s00211-004-0569-yzbMath1068.65073OpenAlexW2118075667MaRDI QIDQ1770257

Roger Fletcher, Yu-Hong Dai

Publication date: 14 April 2005

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00211-004-0569-y



Related Items

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, A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization, Optimal \(L_2\)-norm empirical importance weights for the change of probability measure, The active-set method for nonnegative regularization of linear ill-posed problems, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, Hybrid spectral gradient method for the unconstrained minimization problem, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, An active set truncated Newton method for large-scale bound constrained optimization, LMBOPT: a limited memory method for bound-constrained optimization, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems, Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming, Monotone projected gradient methods for large-scale box-constrained quadratic programming, Steepest descent method with random step lengths, Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization, Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis, Multiple graphs clustering by gradient flow method, Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems, Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization, A new two-step gradient-type method for large-scale unconstrained optimization, Regularized quadratic penalty methods for shape from shading, Duality-based algorithms for total-variation-regularized image restoration, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, Shrinking gradient descent algorithms for total variation regularized image denoising, Maximum-likelihood detection based on branch and bound algorithm for MIMO systems, A multivariate spectral projected gradient method for bound constrained optimization, NPtool: a MATLAB software for nonnegative image restoration with Newton projection methods, Fast projections onto mixed-norm balls with applications, A new method of moving asymptotes for large-scale linearly equality-constrained minimization, A cyclic projected gradient method, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, An effective region force for some variational models for learning and clustering, Solving inverse source problems by the orthogonal solution and kernel correction algorithm (OSKCA) with applications in fluorescence tomography, Impulse noise removal by a nonmonotone adaptive gradient method, The chaotic nature of faster gradient descent methods, Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints, An active set limited memory BFGS algorithm for large-scale bound constrained optimization, Efficient algorithms for solving condition number-constrained matrix minimization problems, A new projected Barzilai-Borwein method for the symmetric cone complementarity problem, An efficient gradient method using the Yuan steplength, Prediction-correction method with BB step sizes, On the quadratic eigenvalue complementarity problem over a general convex cone, A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints, Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems, Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations, Solving bound constrained optimization via a new nonmonotone spectral projected gradient method, A Barzilai-Borwein type method for minimizing composite functions, Solving the discrete Euler-Arnold equations for the generalized rigid body motion, An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices, An improved gradient projection-based decomposition technique for support vector machines, On a scalable nonparametric denoising of time series signals, Improved SVRG for finite sum structure optimization with application to binary classification, A computation study on an integrated alternating direction method of multipliers for large scale optimization, Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization, Projected nonmonotone search methods for optimization with orthogonality constraints, Stochastic variance reduced gradient methods using a trust-region-like scheme, The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints, Steplength selection in gradient projection methods for box-constrained quadratic programs, Large correlation analysis, Solving equations via the trust region and its application to a class of stochastic linear complementarity problems, A box constrained gradient projection algorithm for compressed sensing, A feasible method for optimization with orthogonality constraints, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, A limited memory steepest descent method, Sample size selection in optimization methods for machine learning, Recovery of seismic wavefields by an \(l_{q}\)-norm constrained regularization method, Optimal control for the Navier-Stokes equation with time delay in the convection: analysis and finite element approximations, On nonmonotone Chambolle gradient projection algorithms for total variation image restoration, A delayed weighted gradient method for strictly convex quadratic minimization, On efficiency of nonmonotone Armijo-type line searches, Faster gradient descent and the efficient recovery of images, An algorithm for the fast solution of symmetric linear complementarity problems, Recovery of the local volatility function using regularization and a gradient projection method, Barzilai-Borwein-like methods for the extreme eigenvalue problem, A new nonmonotone filter Barzilai–Borwein method for solving unconstrained optimization problems, On the global convergence of a new spectral residual algorithm for nonlinear systems of equations, On sparse beamformer design with reverberation, An affine-scaling interior-point CBB method for box-constrained optimization, An efficient optimization approach for a cardinality-constrained index tracking problem, A first-order multigrid method for bound-constrained convex optimization, A framework of constraint preserving update schemes for optimization on Stiefel manifold, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, Solving nonlinear systems of equations via spectral residual methods: stepsize selection and applications, An alternate gradient method for optimization problems with orthogonality constraints, Some projection methods with the BB step sizes for variational inequalities, On the inexact scaled gradient projection method, On \(R\)-linear convergence analysis for a class of gradient methods, A family of spectral gradient methods for optimization, A scalable computational platform for particulate Stokes suspensions, An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization, A modified spectral conjugate gradient projection algorithm for total variation image restoration, Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities, On the acceleration of the Barzilai-Borwein method, Diagonal BFGS updates and applications to the limited memory BFGS method, Nomonotone spectral gradient method for sparse recovery, Mixed and hybrid Petrov-Galerkin finite element discretization for optimal control of the wave equation, Linearly Constrained Non-Lipschitz Optimization for Image Restoration, A Solver for Nonconvex Bound-Constrained Quadratic Optimization, Data-driven distributionally robust risk parity portfolio optimization, On the rate of convergence of projected Barzilai–Borwein methods, Bregman iterative algorithms for 2D geosounding inversion, A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing, On the convergence rate of scaled gradient projection method, Projected gradient algorithms for optimization over order simplices, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy, A gradient method exploiting the two dimensional quadratic termination property, A barrier method for contact avoiding particles in Stokes flow, Combined Newton-gradient method for constrained root-finding in chemical reaction networks, A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems, A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints, Gradient-based method with active set strategy for $\ell _1$ optimization, A non-monotone linear search algorithm with mixed direction on Stiefel manifold, Gradient methods exploiting spectral properties, Improving ultimate convergence of an augmented Lagrangian method, A NONMONOTONE FILTER BARZILAI-BORWEIN METHOD FOR OPTIMIZATION, IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS, Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems, Gradient descent and fast artificial time integration, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, A hybrid splitting method for smoothing Tikhonov regularization problem, Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints, Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, On projected alternating BB methods for variational inequalities, Riemannian Optimization on the Symplectic Stiefel Manifold, AN ADAPTIVE GRADIENT ALGORITHM FOR LARGE-SCALE NONLINEAR BOUND CONSTRAINED OPTIMIZATION, NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS, Approximate first-order primal-dual algorithms for saddle point problems, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, An Orthogonalization-Free Parallelizable Framework for All-Electron Calculations in Density Functional Theory, Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems, A trust region method based on a new affine scaling technique for simple bounded optimization, A non-monotonic method for large-scale non-negative least squares, Scaling techniques for gradient projection-type methods in astronomical image deblurring, A Spectral Gradient Projection Method for the Positive Semi-definite Procrustes Problem


Uses Software


Cites Work