Convexity and concavity detection in computational graphs: Tree walks for convexity assessment

INFORMS Journal on Computing

Volumn 22, Issue 1, 2010, Pages 26-43

  Fourer, Robert ^a   Maheshwari, Chandrakant ^b   Neumaier, Arnold ^c   Orban, Dominique ^d   Schichl, Hermann ^c  

^a Northwestern University   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI   (India)

^c UNIVERSITY OF VIENNA   (Austria)

^d GERAD   (Canada)

Author keywords

Constrained optimization; Convexity disproving; Convexity proving; Directed acyclic graph

Indexed keywords

EID: 77949398720     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0321     Document Type: Article

References (33)

1. Avriel, M., W. E. Diewert, S. Schaible, I. Zang. 1988. Generalized Concavity. Plenum, New York.
2. Bauer, F. L. 1974. Computational graphs and rounding error. SIAM J. Numer. Anal. 11(1) 87-96.
3. Bondarenko, A., D. Bortz, E. D. Dolan, M. Merritt, J. J. Moré, T. S. Munson. 2004. COPS: Large-scale optimization problems. Retrieved May 18, 2009, http://www.mcs.anl.gov/∼more/cops.
4. Boyd, S., L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press, Cambridge, UK.
5. Chinneck, J. W. 2001. Analyzing mathematical programs using MProbe. Ann. Oper. Res. 104(1-4) 33-48.
6. Choi, M. D., T. Y. Lam, B. Reznick. 1995. Sums of squares of real polynomials. B. Jacob, A. Rosenberg, eds. K-Theory and algebraic geometry: Connections with quadratic forms and division algebras. Proceedings Symposia in Pure Mathematics, Vol. 58, Part 2. American Math Society, Providence, RI, 103-126.
7. Dolan, E. D., J. J. Moré, T. S. Munson. 2004. Benchmarking optimization software with COPS 3.0. Technical Report ANL/MCS-TM- 273, Argonne National Laboratory, Argonne, IL.
8. Fourer, R., D. Orban. 2007. Dr. Ampl-A meta solver for optimization. Technical Report G-2007-10, GERAD, Montréal, http://www.gerad.ca/ ∼orban/drampl.
9. Fourer, R., D. M. Gay, B. W. Kernighan. 2002. AMPL: A Modeling Language for Mathematical Programming, 2nd ed. Duxbury Press, Brooks/Cole Publishing Company, Pacific Grove, CA.
10. Gay, D. M. 2002. Hooking your solver to AMPL. Retrieved May 17, 2009, http://www.ampl.com/REFS/hooking2.pdf.
11. Gould, N. I. M., D. Orban, P. L. Toint. 2003a. CUTEr and SifDec, a constrained and unconstrained testing environment, revisited. Trans. ACM Math. Software 29(4) 373-394.
12. Gould, N. I. M., D. Orban, P. L. Toint. 2003b. GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. Trans. ACM Math. Software 29(4) 353-372.
13. Gould, N. I. M., S. Lucidi, M. Roma, P. L. Toint. 1999. Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2) 504-525.
14. Grant, M. C., S. P. Boyd. 2008. Graph implementations for non-smooth convex programs. V. Blondel, S. Boyd, H. Kimura, eds. Recent Advances in Learning and Control (A Tribute to M. Vidyasagar). Lecture Notes in Control and Information Sciences, Vol. 371. Springer-Verlag, Berlin, 95-110.
15. Grant, M. C., S. Boyd, Y. Ye. 2006. Disciplined convex programming. L. Liberti, N. Maculan, eds. Global Optimization: From Theory to Implementation. Nonconvex Optimization and Its Applications Series, Springer, Dordrecht, The Netherlands, 155-210.
16. Grant, M. C., S. Boyd, Y. Ye. 2008. CVX: Matlab software for disciplined convex programming. Retrieved May 17, 2009, http://www.stanford.edu/∼boyd/ cvx.
17. Griewank, A. 2000. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Frontiers in Applied Mathematics, No. FR19. SIAM, Philadelphia.
18. Hock, W., K. Schittkowski. 1981. Test Examples for Nonlinear Programming Codes. Lectures Notes in Economics and Mathematical Systems, Vol. 187. Springer-Verlag, New York.
19. Kantorovich, L. V. 1957. On a mathematical symbolism convenient for performing machine calculations. Dokl. Akad. Nauk SSSR 113(4) 738-741. (In Russian).
20. Lobo, M. S., L. Vandenberghe, S. Boyd, H. Lebret. 1998. Applications of second-order cone programming. Linear Algebra Its Appl. 284 193-228.
21. Mattingley, J., S. Boyd. 2008. CVXMOD-Convex optimization software in Python. Retrieved May 17, 2009, http://www.cvxmod.net.
22. Moré, J. J., B. S. Garbow, K. E. Hillstrom. 1981. Testing unconstrained optimization software. Trans. ACM Math. Software 7(1) 17-41.
23. Nenov, I. P., D. H. Fylstra, L. V. Kolev. 2004. Convexity determination in the Microsoft Excel solver using automatic differentiation techniques. Technical report, Frontline Systems Inc., Incline Village, NV.
24. Neumaier, A., H. Schichl. 2003. Sharpening the Karush-John optimality conditions. Preprint, University of Vienna, Vienna.
25. Reznick, B. 2000. Some concrete aspects of Hilbert's 17th problem. Contemporary Math. 253 251-272.
26. Schichl, H. 2004a. COCONUT: COntinuous CONstraints-Updating the technology. Retrieved May 17, 2009, http://www.mat.univie.ac.at/coconut.
27. Schichl, H. 2004b. COCONUT environment: An open source solver platform for global optimization problems. http://www. mat.univie.ac.at/coconut- environment.
28. Schichl, H. A. Neumaier. 2003. Interval analysis on directed acyclic graphs for global optimization. Preprint, University of Vienna, Vienna.
29. Steihaug, T. 1983. The conjugate gradient method and trust regions in large scale optimization. SIAM J. Numer. Anal. 20(3) 626-637.
30. Stoutmeyer, D. R. 1978. Automatic categorization of optimization problems: An application of computer symbolic mathematics. Oper. Res. 26(5) 773-788.
31. Toint, Ph. L. 1981. Towards an efficient sparsity exploiting Newton method for minimization. I. S. Duff, ed. Sparse Matrices and Their Uses. Academic Press, London, 57-88.
32. Vanderbei, R. J. 2008. Nonlinear optimization models. Retrieved December 15, http://www.orfe.princeton.edu/∼rvdb/ampl/nlmodels.
33. Van Voorhis, T., F. A. Al-Khayyal. 2003. Difference of convex solutions of quadratically constrained optimization problems. Eur. J. Oper. Res. 148(2) 349-362.