A nonmonotone line search technique for Newton's method
SIAM Journal on Numerical Analysis
Global convergence of a class of trust region algorithms for optimization with simple bounds
SIAM Journal on Numerical Analysis
A constrained least squares regularization method for nonlinear ill-posed problems
SIAM Journal on Control and Optimization
SIAM Journal on Numerical Analysis
SIAM Journal on Numerical Analysis
On combining feasibility, descent and superlinear convergence in inequality constrained optimization
Mathematical Programming: Series A and B
Nonmonotone line search for minimax problems
Journal of Optimization Theory and Applications
CUTE: constrained and unconstrained testing environment
ACM Transactions on Mathematical Software (TOMS)
A trust-region strategy for minimization on arbitrary domains
Mathematical Programming: Series A and B
A semidefinite framework for trust region subproblems with applications to large scale minimization
Mathematical Programming: Series A and B
Estimation of the optical constants and the thickness of thin films using unconstrained optimization
Journal of Computational Physics
A D. C. Optimization Algorithm for Solving the Trust-Region Subproblem
SIAM Journal on Optimization
A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
SIAM Journal on Optimization
Minimization of a Large-Scale Quadratic Function Subject to a Spherical Constraint
SIAM Journal on Optimization
The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
SIAM Journal on Optimization
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
SIAM Journal on Optimization
On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
SIAM Journal on Optimization
Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients
Computational Optimization and Applications
Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
Numerical Comparison of Augmented Lagrangian Algorithms for Nonconvex Problems
Computational Optimization and Applications
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
Computers and Operations Research
Gradient Methods with Adaptive Step-Sizes
Computational Optimization and Applications
Spectral projected subgradient with a momentum term for the Lagrangean dual approach
Computers and Operations Research
Minimizing the object dimensions in circle and sphere packing problems
Computers and Operations Research
Nonmonotone projected gradient methods based on barrier and Euclidean distances
Computational Optimization and Applications
Computational Optimization and Applications
Quasi-Newton acceleration for equality-constrained minimization
Computational Optimization and Applications
Deterministic Defuzzification Based on Spectral Projected Gradient Optimization
Proceedings of the 30th DAGM symposium on Pattern Recognition
Hybrid spectral gradient method for the unconstrained minimization problem
Journal of Global Optimization
Second-order negative-curvature methods for box-constrained and general constrained optimization
Computational Optimization and Applications
Continuous GRASP with a local active-set method for bound-constrained global optimization
Journal of Global Optimization
Orthogonal packing of identical rectangles within isotropic convex regions
Computers and Industrial Engineering
Affine puzzle: realigning deformed object fragments without correspondences
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part II
Convex constrained optimization for large-scale generalized Sylvester equations
Computational Optimization and Applications
A projected---gradient interior---point algorithm for complementarity problems
Numerical Algorithms
Block relaxation and majorization methods for the nearest correlation matrix with factor structure
Computational Optimization and Applications
Computing a Nearest Correlation Matrix with Factor Structure
SIAM Journal on Matrix Analysis and Applications
A benchmark evaluation of large-scale optimization approaches to binary tomography
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Coverage segmentation based on linear unmixing and minimization of perimeter and boundary thickness
Pattern Recognition Letters
Binary tomography with deblurring
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Evaluating bound-constrained minimization software
Computational Optimization and Applications
Computational Optimization and Applications
A cyclic projected gradient method
Computational Optimization and Applications
| Hi-index | 0.00 |
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.