Algorithm 813: SPG - Software for Convex-Constrained Optimization

ACM Transactions on Mathematical Software

Volumn 27, Issue 3, 2001, Pages 340-349

  Birgin, Ernesto G ^a   Martínez, José Mario ^b   Raydan, Marcos ^c  

^a Inst de Matematica e Estatistica   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c FACULTAD DE CIENCIAS   (Venezuela)

Author keywords

Algorithms; Bound constrained problems; D.3.2 Programming Languages : Language Classifications; G.1.6 Numerical Analysis : Optimization gradient methods; G.4 Mathematics of Computing : Mathematical Software; Large scale problems

Indexed keywords

EID: 18044400238     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/502800.502803     Document Type: Article

References (27)

1. BARZILAI, J. AND BORWEIN, J. M. 1988. Two point step size gradient methods. IMA J. Numer. Anal. 8, 141-148.
2. BERTSEKAS, D. P. 1976. On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Automat. Cont. 21, 174-184.
3. BIRGIN, E. G., BILOTI, R., TYGEL, M., AND SANTOS, L. T. 1999a. Restricted optimization: a clue to a fast and accurate implementation of the common reflection surface stack method. J. Appl. Geophys. 42, 143-155.
4. BIRGIN, E. G., CHAMBOULEYRON, I., AND MARTÍNEZ, J. M. 1999b. Estimation of the optical constants and the thickness of thin films using unconstrained optimization. J. Computat. Phys. 151, 862-880.
5. BIRGIN, E. G. AND EVTUSHENKO, Y. G. 1998. Automatic differentiation and spectral projected gradient methods for optimal control problems. Optimiz. Meth. Soft. 10, 125-146.
6. BIRGIN, E. G., MARTÍNEZ, J. M., AND RAYDAN, M. 2000. Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optimiz. 10, 1196-1211.
7. BONGARTZ, I., CONN, A. R., GOULD, N. I. M., AND TOINT, P. L. 1995. CUTE: Constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 123-160.
8. BONNANS, J. F., PANIER, E., TITS, A., AND ZHOU, J. 1992. Avoiding the Maratos effect by means of a nonmonotone line search: II. Inequality problems - feasible iterates. SIAM J. Numer. Anal. 29, 1187-1202.
9. CONN, A. R., GOULD, N. I. M., AND TOINT, P. L. 1988. Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25, 433-460.
10. CONN, A. R., GOULD, N. I. M., AND TOINT, P. L. 1991. A globally convergent augmented Lagrangean algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28, 545-572.
11. GRIPPO, L., LAMPARIELLO, F., AND LUCIDI, S. 1986. A nonmonotone line search technique for Newton's method. SIAM J. Numer. Anal. 23, 707-716.
12. HEINKENSCHLOSS, M. 1993. Mesh independence for nonlinear least squares problems with norm constraints. SIAM J. Optimiz. 3, 81-117.
13. LAWRENCE, C. T. AND TITS, A. L. 1996. Nonlinear equality constraints in feasible sequential quadratic programming. Optimiz. Meth. Softw. 6, 265-282.
14. LUCIDI, S., PALAGI, L., AND ROMA, M. 1998. On some properties of quadratic programs with a convex constraint. SIAM J. Optimiz. 8, 105-122.
15. MARTÍNEZ, J. M. AND SANTOS, S. A. 1995. A trust region strategy for minimization on arbitrary domains. Math. Prog. 68, 267-302.
16. MARTÍNEZ, J. M. AND SANTOS, S. A. 1997. Convergence results on an algorithm for norm constrained regularization and related problems. RAIRO Oper. Res. 31, 269-294.
17. MULATO, M., CHAMBOULEYRON, I., BIRGIN, E. G., AND MARTÍNEZ, J. M. 2000. Determination of thickness and optical constants of a-Si:H films from transmittance data. Appl. Phys. Lett. 77, 2133-2135.
18. PANIER, E. AND TITS, A. L. 1993. On combining feasibility, descent and superlinear convergence in inequality constrained optimization. Math. Prog. 59, 261-276.
19. PHAM DINH, T. AND HOAI AN, L. T. 1998. A D.C. optimization algorithm for solving the trust region problem. SIAM J. Optimiz. 8, 476-505.
20. RAYDAN, M. 1993. On the Barzilai and Borwein choice of steplength for the gradient method. IMA J. Numer. Anal. 13, 321-326.
21. RAYDAN, M. 1997. The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem. SIAM J. Optimiz. 7, 26-33.
22. RENDL, F. AND WOLKOWICZ, H. 1997. A semidefinite framework to trust region subproblems with application to large scale minimization. Mathemat. Prog. 77, 273-299.
23. ROJAS, M., SANTOS, S. A., AND SORENSEN, D. C. 2000. A new matrix-free algorithm for the large-scale trust-region subproblem. SIAM J. Optimiz. 11, 611-646.
24. SORENSEN, D. C. 1997. Minimization of a large scale quadratic function subject to an ellipsoidal constraint. SIAM J. Optimiz. 7, 141-161.
25. VOGEL, C. R. 1990. A constrained least-squares regularization method for nonlinear ill-posed problems. SIAM J. on Control and Optimization 28, 34-49.
26. ZHOU, J. L. AND TITS, A. L. 1993. Nonmonotone line search for minimax problems. J. Optimiz. Theory and Applications 76, 455-476.
27. ZHOU, J. L. AND TITS, A. L. 1997. User's guide for FFSQP version 3.7: A Fortran code for solving optimization programs, possibly minimax, with general inequality constraints and linear equality constraints, generating feasible iterates. Tech. Rep. SRC-TR-92-107r5, Institute for Systems Research, University of Maryland.