Nonconvex structures in nonlinear programming

Operations Research

Volumn 52, Issue 3, 2004, Pages 368-383

  Scholtes, Stefan ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Mathematics: piecewise linear, combinatorics; Programming: nonlinear, nondifferentiable, complementarity

Indexed keywords

COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; DECISION THEORY; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

MATHEMATICS:PIECEWISE LINEAR, COMBINATORICS; OPTIMIZATION PROBLEMS; PROGRAMMING:NONLINEAR, COMPLEMENTARITY; SEQUENTIAL QUADRATIC PROGRAMMING (SQP);

NONLINEAR PROGRAMMING;

EID: 10844243072     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1030.0102     Document Type: Article

References (33)

1. Bartels, S. G., L. Kuntz, S. Scholtes. 1995. Continuous selections of linear functions and nonsmooth critical point theory. Nonlinear Anal., Theory, Methods, Appl. 24 385-407.
2. Bonnans, J. F., G. Launay, 1992. Implicit trust region algorithm for constrained optimization. Technical report, INRIA, Le Chesnay, France.
3. Bouligand, G. 1932. Sur la semi-continuité d'inclusions et quelques sujets connexes. Enseign. Math. 31 11-22.
4. Cheng, C. K., X. Deng, Y. Z. Liao, S. Z. Yao, 1992. Symbolic layout compaction under conditional design rules. IEEE Trans. Comput. Aided Design 11 475-486.
5. Clarke, F. H. 1983. Optimization and Nonsmooth Analysis. John Wiley and Sons, New York.
6. Conn, A. R., M. Mongeau, 1998. Discontinuous piecewise linear optimization. Math. Programming 80 315-380.
7. Conn, A. R., N. I. M. Gould, P. L. Toint. 2000. Trust-Region Methods. SIAM, Philadelphia, PA.
8. Dontchev, A. L. 1996. Local convergence of Newton's method for generalized equations. Comptes Rendus de l'Académie des Sciences de Paris 332(Ser. I) 327-331.
9. Fletcher, R. 1987. Practical Methods of Optimization, 2nd ed. John Wiley and Sons, Chichester, U.K.
10. Fourer, R. 1985. A simplex algorithm for piecewise-linear programming I: Derivation and proof. Math. Programming 33 204-233.
11. Fourer, R. 1988. A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy. Math. Programming 41 281-315.
12. Fourer, R. 1992. A simplex algorithm for piecewise-linear programming III: Computational analysis and applications. Math. Programming 53 213-235.
13. Hochbaum, D. 1993. Complexity and algorithms for logical constraints with applications to VLSI layout, compaction and clocking. Stud. Locational Analysis 4(June) 159-164.
14. Kirjner-Neto, C., E. Polak. 1998. On the conversion of optimization problems with max-min constraints to standard optimization problems. SIAM J. Optim. 8 887-915.
15. Klatte, D., B. Kummer. 2002a. Nonsmooth Equations in Optimization. Kluwer Academic Publishers, Boston, MA.
16. Klatte, D., B. Kummer. 2002b. Constrained minima and Lipschitzian penalities in metric spaces. SIAM J. Optim. 13 619-633.
17. Kummer, B. 1992. Newton's method based on generalized derivatives for nonsmooth functions: Convergence analysis. W. Oettli, D. Pallaschke, eds. Advances in Optimization. Springer Verlag, Berlin, Germany, 171-194.
18. Lemaréchal, C. 1978. Bundle methods in nonsmooth optimization. C. Lemaréchal, R. Mifflin, eds. Proc. IIASA Workshop, Nonsmooth Optimization. Pergamon Press, Oxford, U.K., 79-102.
19. Luo, Z. Q., J. S. Pang, D. Ralph. 1996. Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge, U.K.
20. Moh, T. S., T. S. Chang, S. L. Hakimi. 1996. Globally optimal floorplanning for a layout problem. IEEE Trans. Circuits Systems I: Fundamental Theory Appl. 43 713-720.
21. Ralph, D., E. Polak. 2000. A first-order algorithm for semi-infinite min-max-min problems. Manuscript, Judge Institute of Management, University of Cambridge, Cambridge, U.K.
22. Robinson, S. M. 1974. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear programming algorithms. Math. Programming 7 1-16.
23. Robinson, S. M. 1994. Newton's method for a class of nonsmooth functions. Set-Valued Anal. 2 291-305.
24. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
25. Scheel, H., S. Scholtes. 2000. Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity. Math. Oper. Res. 25 1-25.
26. Scholtes, S. 1994. Introduction to piecewise differentiable equations. Habilitation thesis, University of Karlsruhe, Karlsruhe, Germany.
27. Scholtes, S. 2002. Active set methods for linear and quadratic programs with complementarity constraints. Working paper, Judge Institute of Management, University of Cambridge, Cambridge, U.K.
28. Scholtes, S., M. Stöhr. 1999. Exact penalization of mathematical programs with equilibrium constraints. SIAM J. Control Optim. 37 617-652.
29. Scholtes, S., M. Stöhr. 2001. How stringent is the linear independence assumption for mathematical programs with Stationarity constraints? Math. Oper. Res. 26 851-863.
30. Schramm, H., J. Zowe. 1992. A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results. SIAM J. Optim. 2 121-152.
31. Stöhr, M. 1999. Nonsmooth trust region methods and their applications to mathematical programs with equilibrium constraints. Ph.D. thesis, Shaker-Verlag, Aachen, Germany.
32. Wilson, R. B. 1963. A simplicial algorithm for concave programming. Ph.D. dissertation, Harvard Business School, Boston, MA.
33. Zoutendijk, G. 1960. Methods of Feasible Directions. Elsevier, Amsterdam, The Netherlands.