Inexact restoration method for derivative-free optimization with smooth constraints

SIAM Journal on Optimization

Volumn 23, Issue 2, 2013, Pages 1189-1213

  Bueno, L F ^a   Friedlander, A ^b   Martinez J M ^b   Sobral, F N C ^c  

^a FEDERAL UNIVERSITY OF SÃO PAULO   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c Research and Development   (Brazil)

Author keywords

Derivative free optimization; Global convergence; Inexact restoration; Numerical experiments

Indexed keywords

COMPUTER IMPLEMENTATIONS; CONSTRAINED OPTIMI-ZATION PROBLEMS; DERIVATIVE-FREE METHODS; DERIVATIVE-FREE OPTIMIZATION; GLOBAL CONVER-GENCE; INEXACT RESTORATION; LINEAR APPROXIMATIONS; NUMERICAL EXPERIMENTS;

CONSTRAINED OPTIMIZATION; EXPERIMENTS; RESTORATION;

ITERATIVE METHODS;

EID: 84880062235     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/110856253     Document Type: Article

References (61)

1. J. Abadie and J. Carpentier, Generalization of the Wolfe reduced-gradient method to the case of nonlinear constraints, in Optimization, R. Fletcher, ed., Academic Press, New York, 1968, pp. 37-47.
2. A. Agapie and C. Bratianu, Repetitive stochastic guesstimation for estimating parameters in a GARCH model, J. Econom. Forecast., 2 (2010), pp. 213-222.
3. R. Andreani, E. G. Birgin, J. M. Mart'inez, and M. L. Schuverdt, On Augmented Lagrangian methods with general lower-level constraints, SIAM J. Optim., 18 (2007), pp. 1286-1309.
4. R. Andreani, G. Haeser, and J. M. Mart'inez, On sequential optimality conditions for smooth constrained optimization, Optimization, 60 (2011), pp. 627-641.
5. R. Andreani, G. Haeser, M. L. Schuverdt, and P. J. S. Silva, A relaxed constant positive linear dependence constraint qualification and applications, Math. Program., 135 (2012), pp. 255-273.
6. R. Andreani, G. Haeser, M. L. Schuverdt, and P. J. S. Silva, Two new constraint qualifications and applications, SIAM J. Optim., 22 (2012), pp. 1109-1135.
7. R. Andreani, J. M. Mart'inez, and M. L. Schuverdt, On the relation between the constant positive linear dependence condition and quasinormality constraint qualification, J.Optim. Theory Appl., 125 (2005), pp. 473-485.
8. R. Andreani, J. M. Mart'inez, and B. F. Svaiter, A new sequential optimality condition for constrained optimization and algorithmic consequences, SIAM J. Optim., 20 (2011), pp. 3533-3554.
9. C. Audet and J. E. Dennis, Jr., Analysis of generalized pattern searches, SIAM J. Optim., 13 (2003), pp. 889-903.
10. C. Audet and J. E. Dennis, Jr., Mesh adaptive direct search algorithms for constrained optimization, SIAM J. Optim., 17 (2006), pp. 188-217.
11. C. Audet and J. E. Dennis, Jr., A progressive barrier for derivative-free nonlinear programming, SIAM J. Optim., 20 (2009), pp. 445-472.
12. N. Banihashemi and C. Y. Kaya, Inexact restoration for Euler discretization of boxconstrained optimal control problems, J. Optim. Theory Appl., 156 (2013), pp. 726-760.
13. R. H. Bielschowsky and F. A. M. Gomes, Dynamic control of infeasibility in equality constrained optimization, SIAM J. Optim., 19 (2008), pp. 1299-1325.
14. E. G. Birgin, I. Chambouleyron, and J. M. Mart'inez, Estimation of the optical constants and the thickness of thin films using unconstrained optimization, J. Comput. Phys., 151 (1999), pp. 862-880.
15. E. G. Birgin and J. M. Mart'inez, Local convergence of an inexact-restoration method and numerical experiments, J. Optim. Theory Appl., 127 (2005), pp. 229-247.
16. A. R. Conn, K. Scheinberg, and L. N. Vicente, Introduction to Derivative-Free Optimization, MPS/SIAM Ser. Optim., SIAM, Philadelphia, 2009.
17. M. A. Diniz-Ehrhardt, J. M. Mart'inez, and L. G. Pedroso, Derivative-free methods for nonlinear programming with general lower-level constraints, Comput. Appl. Math., 30 (2011), pp. 19-52.
18. E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Math. Program., 91 (2002), pp. 201-213.
19. A. Fischer and A. Friedlander, A new line search inexact restoration approach for nonlinear programming, Comput. Optim. Appl., 46 (2010), pp. 333-346.
20. N. I. M. Gould and Ph. L. Toint, Nonlinear programming without a penalty function or a filter, Math. Program., 122 (2010), pp. 155-196.
21. C. C. Gonzaga, E. Karas, and M. Vanti, A globally convergent filter method for nonlinear programming, SIAM J. Optim., 14 (2003), pp. 646-669.
22. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes, Lecture Notes in Econom. and Math. Systems 187, Springer, New York, 1981.
23. E. W. Karas, C. C. Gonzaga, and A. A. Ribeiro, Local convergence of filter methods for equality constrained non-linear programming, Optimization, 59 (2010), pp. 1153-1171.
24. C. Y. Kaya, Inexact restoration for Runge-Kutta discretization of optimal control problems, SIAM J. Numer. Anal., 48 (2010), pp. 1492-1517.
25. T. G. Kolda and J. D. Griffin, Nonlinearly-Constrained Optimization Using Asynchronous Parallel Generating Set Search, Technical report SAND2007-3257, Sandia National Laboratories, 2007.
26. T. G. Kolda, R. M. Lewis, and V. Torczon, Optimization by direct search: new perspectives on some classical and modern methods, SIAM Rev., 45 (2003), pp. 385-482.
27. T. G. Kolda, R. M. Lewis, and V. Torczon, A Generating Set Direct Search Augmented Lagrangian Algorithm for Optimization with a Combination of General and Linear Constraints, Technical report SAND2006-5315, Sandia National Laboratories, 2006.
28. T. G. Kolda, R. M. Lewis, and V. Torczon, Stationarity results for generating set search for linearly constrained optimization, SIAM J. Optim., 17 (2006), pp. 943-968.
29. R. Kollmann, S. Maliar, B. A. Malin, and P. Pichler, Comparison of solutions to the multi-country real business cycle model, J. Econom. Dynam. Control, 35 (2011), pp. 186-202.
30. L. S. Lasdon, Reduced gradient methods, in Nonlinear Optimization 1981, M. J. D. Powell, ed., Academic Press, New York, 1982, pp. 235-242.
31. S. Le Digabel, Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm, ACM Trans. Math. Software, 37 (2011), pp. 1-15.
32. R. M. Lewis and V. Torczon, Pattern search algorithms for bound constrained minimization, SIAM J. Optim., 9 (1999), pp. 1082-1099.
33. R. M. Lewis and V. Torczon, Pattern search algorithms for linearly constrained minimization, SIAM J. Optim., 10 (2000), pp. 917-941.
34. R. M. Lewis and V. Torczon, A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds, SIAM J. Optim., 12 (2002), pp. 1075-1089.
35. R. M. Lewis and V. Torczon, A Direct Search Approach to Nonlinear Programming Problems Using an Augmented Lagrangian Method with Explicit Treatment of Linear Constraints, Technical report WM-CS-2010-01, College of William and Mary, 2010.
36. G. Liuzzi, S. Lucidi, and M. Sciandrone, Sequential penalty derivative-free methods for nonlinear constrained optimization, SIAM J. Optim., 20 (2010), pp. 2614-2635.
37. S. Lucidi, M. Sciandrone, and P. Tseng, Objective-derivative-free methods for constrained optimization, Math. Program., 92 (2002), pp. 37-59.
38. J. M. Mart'inez, Generalization of the methods of Brent and Brown for solving nonlinear simultaneous equations, SIAM J. Numer. Anal., 16 (1979), pp. 434-448.
39. J. M. Mart'inez, Inexact restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming, J. Optim. Theory Appl., 111 (2001), pp. 39-58.
40. J. M. Mart'inez and E. A. Pilotta, Inexact restoration algorithms for constrained optimization, J. Optim. Theory Appl., 104 (2000), pp. 135-163.
41. J. M. Mart'inez and F. N. C. Sobral, Derivative-free constrained optimization on thin domains, J. Global Optim., DOI: 10.1007/s10898-012-9944-x.
42. J. M. Mart'inez and B. F. Svaiter, A practical optimality condition without constraint qualifications for nonlinear programming, J. Optim. Theory Appl., 118 (2003), pp. 117-133.
43. A. Miele, H. Y. Huang, and J. C. Heideman, Sequential gradient-restoration algorithm for the minimization of constrained functions, ordinary and conjugate gradient version, J. Optim. Theory Appl., 4 (1969), pp. 213-246.
44. A. Miele, A. V. Levy, and E. E. Cragg, Modifications and extensions of the conjugategradient restoration algorithm for mathematical programming problems, J. Optim. Theory Appl., 7 (1971), pp. 450-472.
45. A. Miele, E. M. Sims, and V. K. Basapur, Sequential Gradient-Restoration Algorithm for Mathematical Programming Problems with Inequality Constraints, Part 1, Theory, Aero-Astronautics Report 168, Rice University, 1983.
46. J. J. Moré and S. M. Wild, Benchmarking derivative-free optimization algorithms, SIAM J. Optim., 20 (2009), pp. 172-191.
47. T. D. Plantenga, HOPSPACK 2.0 User Manual, Sandia National Laboratories, Albuquerque, NM, 2009.
48. M. J. D. Powell, A direct search optimization method that models the objective and constraint functions by linear interpolation, in Advances in Optimization and Numerical Analysis, S. Gomez and J.-P. Hennart, eds., Kluwer Academic, Dordrecht, Netherlands, 1994, pp. 51-67.
49. M. J. D. Powell, The BOBYQA Algorithm for Bound Constrained Optimization Without Derivatives, Report NA2009/06, University of Cambridge, Cambridge, UK, 2009.
50. L. Qi and Z. Wei, On the constant positive linear dependence condition and its application to SQP methods, SIAM J. Optim., 10 (2000), pp. 963-981.
51. M. Rom and M. Avriel, Properties of the sequential gradient-restoration algorithm (SGRA), Part 1: Introduction and comparison with related methods, J. Optim. Theory Appl., 62 (1989), pp. 77-98.
52. M. Rom and M. Avriel, Properties of the sequential gradient-restoration algorithm (SGRA), Part 2: Convergence analysis, J. Optim. Theory Appl., 62 (1989), pp. 99-126.
53. J. B. Rosen, The gradient projection method for nonlinear programming, Part 1, Linear Constraints, SIAM J. Appl. Math., 8 (1960), pp. 181-217.
54. J. B. Rosen, The gradient projection method for nonlinear programming, Part 2, Nonlinear Constraints, SIAM J. Appl. Math., 9 (1961), pp. 514-532.
55. W. Semmler and G. Gong, Estimating parameters of real business cycle models, J. Econom. Behav. Organ., 30 (1996), pp. 301-325.
56. R. Swanepoel, Determination of the thickness and optical constants of amorphous silicon, J. Phys. E, 16 (1983), pp. 1214-1222.
57. R. Swanepoel, Determination of surface roughness and optical constants of inhomogeneous amorphous silicon films, J. Phys. E, 17 (1984), pp. 896-903.
58. V. Torczon, On the convergence of pattern search algorithms, SIAM J. Optim. 7 (1997), pp. 1-25.
59. TANGO (Trustable Algorithms for Nonlinear General Optimization), http://www.ime.usp.br/∼egbirgin/tango/ (2005).
60. DFL (Derivative-Free Library), http://www.dis.uniroma1.it/∼lucidi/ DFL/.
61. AMFS (Alan Miller's Fortran Software), http://jblevins.org/mirror/ amiller/.