Nonmonotone Spectral Projected Gradient Methods on Convex Sets

DOI10.1137/S1052623497330963zbMath1047.90077OpenAlexW1973734200MaRDI QIDQ4509759

Marcos Raydan, Ernesto G. Birgin, José Mario Martínez

Publication date: 19 October 2000

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623497330963

zbMATH Keywords

spectral gradient methodnonmonotone line searchlarge-scale problemsbound constrained problemsprojected gradients

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Methods of reduced gradient type (90C52)

Related Items

A matrix-free trust-region Newton algorithm for convex-constrained optimization, Optimization problems in the estimation of parameters of thin films and the elimination of the influence of the substrate., Inexact restoration for derivative-free expensive function minimization and applications, A secant-based Nesterov method for convex functions, An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery, Optimizing the packing of cylinders into a rectangular container: A nonlinear approach, An iteration method to solve multiple constrained least squares problems, Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique, Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, An extended projected residual algorithm for solving smooth convex optimization problems, A Newton Frank-Wolfe method for constrained self-concordant minimization, Two globally convergent nonmonotone trust-region methods for unconstrained optimization, Second-order negative-curvature methods for box-constrained and general constrained optimization, LMBOPT: a limited memory method for bound-constrained optimization, Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming, The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems, Comparison of active-set and gradient projection-based algorithms for box-constrained quadratic programming, Optimal weed population control using nonlinear programming, A nonlinear programming model with implicit variables for packing ellipsoids, Runge-Kutta-like scaling techniques for first-order methods in convex optimization, Hybrid nonmonotone spectral gradient method for the unconstrained minimization problem, Nonmonotone inexact restoration approach for minimization with orthogonality constraints, Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization, An application-based characterization of dynamical distance geometry problems, A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising, An optimal subgradient algorithm for large-scale bound-constrained convex optimization, Evaluating bound-constrained minimization software, Optimal design of multiphase composites under elastodynamic loading, The Uzawa-MBB type algorithm for nonsymmetric saddle point problems, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization, On the steplength selection in gradient methods for unconstrained optimization, Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems, An investigation of feasible descent algorithms for estimating the condition number of a matrix, Construction of quantum states with special properties by projection methods, A nonconvex truncated regularization and box-constrained model for CT reconstruction, Shape optimization for tumor location, Fast projections onto mixed-norm balls with applications, A cyclic projected gradient method, Linear convergence analysis of the use of gradient projection methods on total variation problems, Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints, A spectral conjugate gradient method for solving large-scale unconstrained optimization, A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties, Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization, An active-set proximal-Newton algorithm for \(\ell_1\) regularized optimization problems with box constraints, An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, A dual spectral projected gradient method for log-determinant semidefinite problems, An improved gradient projection-based decomposition technique for support vector machines, Minimizing the object dimensions in circle and sphere packing problems, One-bit tensor completion via transformed tensor singular value decomposition, DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems, Cone complimentary-based numerical manifold method modeling frictional and cohesive contact problems, Sparse signal inversion with impulsive noise by dual spectral projected gradient method, Globally convergent DC trust-region methods, Nonmonotone projected gradient methods based on barrier and Euclidean distances, The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, A new spectral method for \(l_1\)-regularized minimization, Minimizing quadratic functions with semidefinite Hessian subject to bound constraints, A projection method for convex constrained monotone nonlinear equations with applications, Numerical comparison of augmented Lagrangian algorithms for nonconvex problems, On the asymptotic behaviour of some new gradient methods, Steplength selection in gradient projection methods for box-constrained quadratic programs, Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, Spectral gradient projection method for monotone nonlinear equations with convex constraints, Numerical method for the generalized nonnegative tensor factorization problem, Exact spectral-like gradient method for distributed optimization, On efficiency of nonmonotone Armijo-type line searches, A nonmonotone gradient algorithm for total variation image denoising problems, An alternating direction method for solving a class of inverse semi-definite quadratic programming problems, On sparse beamformer design with reverberation, A global Newton method for the nonsmooth vector fields on Riemannian manifolds, An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem, A unified convergence framework for nonmonotone inexact decomposition methods, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, On the asymptotic convergence and acceleration of gradient methods, The gradient projection method with Armijo's step size on manifolds, On large-scale unconstrained optimization and arbitrary regularization, On the inexact scaled gradient projection method, A family of spectral gradient methods for optimization, Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems, A view of computational models for image segmentation, On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches, Regularized graph cuts based discrete tomography reconstruction methods, Spectral gradient methods for linearly constrained optimization, On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization, Convergence properties of monotone and nonmonotone proximal gradient methods revisited, A flexible inexact-restoration method for constrained optimization, An efficient implementation of a trust region method for box constrained optimization, First-order methods for the convex hull membership problem, Hybrid limited memory gradient projection methods for box-constrained optimization problems, Optimality properties of an augmented Lagrangian method on infeasible problems, Minimization subproblems and heuristics for an applied clustering problem, Convergence analysis for the modified spectral projected subgradient method, Stochastic tensor complementarity problem with discrete distribution, An efficient nonmonotone projected Barzilai–Borwein method for nonnegative matrix factorization with extrapolation, Inexact variable metric method for convex-constrained optimization problems, Active Subspace of Neural Networks: Structural Analysis and Universal Attacks, On the complexity of solving feasibility problems with regularized models, Beyond the EM algorithm: constrained optimization methods for latent class model, Convergence properties of inexact projected gradient methods, Fishway Optimization Revisited, Data-driven distributionally robust risk parity portfolio optimization, On the rate of convergence of projected Barzilai–Borwein methods, A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems, A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing, The role of frictional contact of constituent blocks on the stability of masonry domes, Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds, On the convergence rate of scaled gradient projection method, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, On the symmetric quadratic eigenvalue complementarity problem, Projected gradient algorithms for optimization over order simplices, Gradient projection methods for quadratic programs and applications in training support vector machines, A New Augmented Lagrangian Method for MPCCs—Theoretical and Numerical Comparison with Existing Augmented Lagrangian Methods, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, An augmented Lagrangian method for optimization problems with structured geometric constraints, Efficient Nonnegative Matrix Factorization Via Modified Monotone Barzilai-Borwein Method with Adaptive Step Sizes Strategy, Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation, A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering, New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems, A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization, A structured Fletcher-Revees spectral conjugate gradient method for unconstrained optimization with application in robotic model, Positive Definite Matrices: Data Representation and Applications to Computer Vision, Paige's algorithm for solving a class of tensor least squares problem, Doubly iteratively reweighted algorithm for constrained compressed sensing models, Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing, A gradient method exploiting the two dimensional quadratic termination property, A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming, An efficient iterative method for solving a class of constrained tensor least squares problem, Sensitivity analysis and tailored design of minimization diagrams, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems, Global convergence via modified self-adaptive approach for solving constrained monotone nonlinear equations with application to signal recovery problems, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, An overview of nonlinear optimization, Gradient-based method with active set strategy for $\ell _1$ optimization, Inexact gradient projection method with relative error tolerance, Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations, Spectral projected subgradient method for nonsmooth convex optimization problems, Using a spectral scaling structured BFGS method for constrained nonlinear least squares, Gradient methods exploiting spectral properties, Improving ultimate convergence of an augmented Lagrangian method, A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization, Proximal extrapolated gradient methods for variational inequalities, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, On Regularization and Active-set Methods with Complexity for Constrained Optimization, IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS, Accelerated method for optimization over density matrices in quantum state estimation, $\ell _0$ Minimization for wavelet frame based image restoration, IMRO: A Proximal Quasi-Newton Method for Solving $\ell_1$-Regularized Least Squares Problems, Smoothing projected cyclic Barzilai–Borwein method for stochastic linear complementarity problems, On the low rank solution of the Q‐weighted nearest correlation matrix problem, A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint, A projected derivative-free algorithm for nonlinear equations with convex constraints, A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables, Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming., An efficient method for solving a matrix least squares problem over a matrix inequality constraint, On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex, On the Complexity of an Inexact Restoration Method for Constrained Optimization, Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization, Iterative algorithm for the symmetric and nonnegative tensor completion problem, An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps, An efficient optimization approach for a cardinality-constrained index tracking problem, A projected gradient method for optimization over density matrices, Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints, Spectral residual method without gradient information for solving large-scale nonlinear systems of equations, Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms, Unnamed Item, A parallel decomposition algorithm for training multiclass kernel-based vector machines, Alternate step gradient method*, Exact Clustering of Weighted Graphs via Semidefinite Programming, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, Numerical Methods for $Q$-Weighted Nonnegative Matrix Tri-Factorization, Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact, On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence, On the Solution of ℓ₀-Constrained Sparse Inverse Covariance Estimation Problems, Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark, A Shape Optimization Approach to the Problem of Covering a Two-Dimensional Region with Minimum-Radius Identical Balls, 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, Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks, Approximation of Length Minimization Problems Among Compact Connected Sets, Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems, Complexity and performance of an Augmented Lagrangian algorithm, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, Feasible Barzilai–Borwein-like methods for extreme symmetric eigenvalue problems, A non-monotonic method for large-scale non-negative least squares, A modified two-point stepsize gradient algorithm for unconstrained minimization, On the application of the spectral projected gradient method in image segmentation, A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, Hybrid spectral gradient method for the unconstrained minimization problem, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, Packing ellipsoids by nonlinear optimization, An optimization study of a mathematical model of the urine concentrating mechanism of the rat kidney, An active set truncated Newton method for large-scale bound constrained optimization, A biased random-key genetic algorithm for the unequal area facility layout problem, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems, Gradient methods with adaptive step-sizes, A new adaptive Barzilai and Borwein method for unconstrained optimization, A deterministic optimization approach for solving the rainfall disaggregation problem, A globally convergent method for nonlinear least-squares problems based on the Gauss-Newton model with spectral correction, Modified spectral projected subgradient method: convergence analysis and momentum parameter heuristics, A convex optimization approach for solving large scale linear systems, Monotone projected gradient methods for large-scale box-constrained quadratic programming, Computationally efficient approach for the minimization of volume constrained vector-valued Ginzburg-Landau energy functional, On optimal location and management of a new industrial plant: numerical simulation and control, Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization, Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method, Scaling on the spectral gradient method, Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization, ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals, Spectral projected subgradient with a momentum term for the Lagrangean dual approach, Density-based globally convergent trust-region methods for self-consistent field electronic structure calculations, Adjoint-free calculation method for conditional nonlinear optimal perturbations, Duality-based algorithms for total-variation-regularized image restoration, On the optimal design of river fishways, A Newton's method for the continuous quadratic knapsack problem, Optimal subgradient algorithms for large-scale convex optimization in simple domains, Model-based multiple rigid object detection and registration in unstructured range data, Inexact restoration method for minimization problems arising in electronic structure calculations, \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization, A multivariate spectral projected gradient method for bound constrained optimization, A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization, Application of the restrained optimal perturbation method to study the backward heat conduction problem, Non-monotone projection gradient method for non-negative matrix factorization, A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand, Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery, A projected-gradient interior-point algorithm for complementarity problems, Implementation of an optimal first-order method for strongly convex total variation regularization, Modified active set projected spectral gradient method for bound constrained optimization, An active set limited memory BFGS algorithm for bound constrained optimization, On the natural merit function for solving complementarity problems, Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization, Robust least square semidefinite programming with applications, A new analysis on the Barzilai-Borwein gradient method, Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming, Guaranteed clustering and biclustering via semidefinite programming, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm, Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function, Conditional nonlinear optimal perturbation of a coupled Lorenz model, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, Efficient projected gradient methods for cardinality constrained optimization, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, On the quadratic eigenvalue complementarity problem over a general convex cone, Stackelberg strategies for wastewater management, A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem, Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems, A new generalized shrinkage conjugate gradient method for sparse recovery, Solving bound constrained optimization via a new nonmonotone spectral projected gradient method, A Barzilai-Borwein type method for minimizing composite functions, Spectral projected gradient method for stochastic optimization, A class of diagonal quasi-Newton methods for large-scale convex minimization, On a scalable nonparametric denoising of time series signals, A quasi-Newton algorithm for large-scale nonlinear equations, Computing the generalized eigenvalues of weakly symmetric tensors, An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization, Algorithm for inequality-constrained least squares problems, An iteratively approximated gradient projection algorithm for sparse signal reconstruction, A Kronecker approximation with a convex constrained optimization method for blind image restoration, Convex constrained optimization for large-scale generalized Sylvester equations, Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing, Multi-objective Pareto-optimal control: An application to wastewater management, A Fast Algorithm for Maximum Likelihood Estimation of Mixture Proportions Using Sequential Quadratic Programming, Large correlation analysis, Residual algorithm for large-scale positive definite generalized eigenvalue problems, A new line search inexact restoration approach for nonlinear programming, Convergence properties of nonmonotone spectral projected gradient methods, Continuous GRASP with a local active-set method for bound-constrained global optimization, An augmented Lagrangian approach for sparse principal component analysis, Notes on the Dai-Yuan-Yuan modified spectral gradient method, On nonmonotone Chambolle gradient projection algorithms for total variation image restoration, An approach based on dwindling filter method for positive definite generalized eigenvalue problem, An algorithm for the fast solution of symmetric linear complementarity problems, Quasi-Newton acceleration for equality-constrained minimization, Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework, Penalized estimation in additive varying coefficient models using grouped regularization, An affine-scaling interior-point CBB method for box-constrained optimization, Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization, A framework of constraint preserving update schemes for optimization on Stiefel manifold, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization, A globally convergent BFGS method with nonmonotone line search for non-convex minimization, Block relaxation and majorization methods for the nearest correlation matrix with factor structure, Cost minimization of a multiple section power cable supplying several remote telecom equipment, Impulse noise removal by an adaptive trust-region method, A descent algorithm without line search for unconstrained optimization, Nomonotone spectral gradient method for sparse recovery

Uses Software

• LANCELOT