Solving semidefinite quadratic problems within nonsmooth optimization algorithms

Computers and Operations Research

Volumn 23, Issue 11, 1996, Pages 1099-1118

  Frangioni, Antonio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NUMERICAL METHODS; OPTIMIZATION; STANDARDS;

NONSMOOTH OPTIMIZATION ALGORITHMS; SEMIDEFINITE QUADRATIC PROBLEMS;

CONSTRAINT THEORY;

EID: 0030284068     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(96)00006-8     Document Type: Article

References (18)

1. K. C. Kiwiel, Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics, Vol. 1133, Springer-Verlag (1985).
2. C. Lemaréchal, Nondifferentiable optimization. In Handbooks in Opns. Res. and Mgmt. Sci., Vol. I: Optimization (Edited by G. L. Nehmauser, A. H. G. Rinnoy Kan and M. J. Todd), North-Holland (1989).
3. H. Schramm and J. Zowe, A version of the Bundle idea for minimising a nonsmooth function: conceptual idea, convergence analysis, numerical results. SIAM J. Optimization, 2, 121-152 (1992).
4. P. Carraresi, A. Frangioni and M. Nonato, Applying Bundle methods to optimization of polyhedral functions: an applications-oriented development. Technical Report TR 17/95, Dipartimento di Informatica, Università di Piasa (1995).
5. P. E. Gill, W. Murray and M. H. Wright, Practical Optimization Academic Press (1981).
6. M. Powell, ZQPCVX: A FORTRAN subroutine for convex quadratic programming. Report DAMTP 1983/NA17, University of Cambridge (1983).
7. T. J. Carpenter, I. J. Lustig, J. M. Mulvey and D. F. Shanno, Higher-order predictor corrector interior point methods with application to quadratic objectives. SIAM J. on Optimization, 3, 696-725 (1993).
8. K. C. Kiwiel, A method for solving certain quadratic programming problems arising in nonsmooth optimization. IMA J. Numer. Anal. 6, 137-152 (1986).
9. M. F. Monaco, An algorithm for the minimisation of a convex quadratic function over a simplex, Internal Report 56, Dipartimento di Sistemi, Università della Calabria (1987).
10. K. C. Kiwiel, A Cholesky dual method for proximal piecewise linear programming. Numer. Mat. 68, 325-340 (1994).
11. A. M. Geoffrion, Duality in nonlinear programming: a simplified applications oriented development. In Perspective on Optimization: a collection of expository articles (Edited by A. M. Geoffrion). Addison-Wesley (1972).
12. K. C. Kiwiel, A dual method for certain positive semidefinite quadratic programming problems. SIAM J. Sci. Statist. Comput. 10, 175-186 (1989).
13. B. Forte and E. R. Vescay, Solving the inverse problem for function/image approximation using iterated function systems - II. Algorithm and computations. Fractals, 2, 335-346 (1994).
14. R. Mifflin, A feasible descent algorithm for linearly constrained least squares problems. In Nonsmooth Optimization, Vol. 3 of IIASA Proceedings Series (Edited by C. Lemaréchal and R. Miffin). Pergamon Press (1977).
15. L. Equi, G. Gallo, S. Marziale and A. Weintraub, A combined transportation and scheduling problem. Technical Report TR 5/95, Dipartimento di Informatica, Università di Pisa (1995).
16. P. Carraresi, L. Girardi and M. Nonato, Network models, Lagrangean relaxations and subgradient Bundle approach in crew scheduling problems. In Computer Aided Scheduling of Public Transport (Edited by J. Paixao). Lecture Notes in Economical and Mathematical Systems, Springer-Verlag (1995).
17. F. Malucelli and D. Pretolani, Lower bounds for the quadratic semi-assignment problem. Eur. J. Opl. Res. 83 (1995).
18. A. Frangioni and G. Gallo, A Bundle type dual-ascent approach to linear multicommodity min cost flow problems. Presented to HPSNO International Conference, Capri (Italy) 22-23 June (1995).