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 (only showing first 100 items - show all)

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

This page was built for publication: Nonmonotone Spectral Projected Gradient Methods on Convex Sets