SPG
Algorithm 813: SPG -- software for convex-constrained optimization: Fortran 77 software implementing the SPG method is introduced. SPG is a nonmonotone projected gradient algorithm for solving large-scale convex-constrained optimization problems. It combines the classical projected gradient method with the spectral gradient choice of steplength and a nonmonotone line-search strategy. The user provides objective function and gradient values, and projections onto the feasible set. Some recent numerical tests are reported on very large location problems, indicating that SPG is substantially more efficient than existing general-purpose software on problems for which projections can be computed efficiently.
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 65 articles , 1 standard article )
Showing results 1 to 20 of 65.
Sorted by year (- Birgin, E. G.; Haeser, G.; Ramos, Alberto: Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (2018)
- Birgin, E. G.; Martínez, J. M.: On regularization and active-set methods with complexity for constrained optimization (2018)
- Zarepisheh, Masoud; Xing, Lei; Ye, Yinyu: A computation study on an integrated alternating direction method of multipliers for large scale optimization (2018)
- Birgin, E. G.; Lobato, R. D.; Martínez, J. M.: A nonlinear programming model with implicit variables for packing ellipsoids (2017)
- Antonelli, Laura; De Simone, Valentina; di Serafino, Daniela: On the application of the spectral projected gradient method in image segmentation (2016)
- Birgin, E. G.; Lobato, R. D.; Martínez, J. M.: Packing ellipsoids by nonlinear optimization (2016)
- Cherian, Anoop; Sra, Suvrit: Positive definite matrices: data representation and applications to computer vision (2016)
- Bueno, L. F.; Haeser, G.; Martínez, J. M.: A flexible inexact-restoration method for constrained optimization (2015)
- Cui, Ming: Adjoint-free calculation method for conditional nonlinear optimal perturbations (2015)
- Gould, Nicholas I. M.; Orban, Dominique; Toint, Philippe L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization (2015)
- Loreto, Milagros; Crema, Alejandro: Convergence analysis for the modified spectral projected subgradient method (2015)
- Zhou, Yang: Discrete least squares hybrid approximation with regularization on the two-sphere (2015)
- Cominetti, Roberto; Mascarenhas, Walter F.; Silva, Paulo J. S.: A Newton’s method for the continuous quadratic knapsack problem (2014)
- Ernesto Birgin; Jose Martínez; Marcos Raydan: Spectral Projected Gradient Methods: Review and Perspectives (2014) not zbMATH
- Maciel, María C.; Mendonça, María G.; Verdiell, Adriana B.: Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems (2013)
- Birgin, Ernesto G.; Gentil, Jan M.: Evaluating bound-constrained minimization software (2012)
- Bouhamidi, A.; Jbilou, K.: A Kronecker approximation with a convex constrained optimization method for blind image restoration (2012)
- Cheng, Wanyou; Li, Donghui: An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization (2012)
- Andreani, R.; Júdice, J. J.; Martínez, J. M.; Patrício, J.: On the natural merit function for solving complementarity problems (2011)
- Bouhamidi, A.; Jbilou, K.; Raydan, M.: Convex constrained optimization for large-scale generalized Sylvester equations (2011)