Solving semidefinite quadratic problems within nonsmooth optimization algorithms
暂无分享,去创建一个
[1] A. M. Geoffrion. Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .
[2] K. Kiwiel. Methods of Descent for Nondifferentiable Optimization , 1985 .
[3] K. Kiwiel. A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems , 1989 .
[4] Philip E. Gill,et al. Practical optimization , 1981 .
[5] Edward R. Vrscay,et al. Solving The Inverse Problem For Function/image Approximation Using Iterated Function Systems Ii. Alg , 1994 .
[6] C. Lemaréchal. Nondifferentiable optimization , 1989 .
[7] Maddalena Nonato,et al. Network Models, Lagrangean Relaxation and Subgradients Bundle Approach in Crew Scheduling Problems , 1995 .
[8] John M. Mulvey,et al. Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives , 1993, SIAM J. Optim..
[9] K. Kiwiel. A Cholesky dual method for proximal piecewise linear programming , 1994 .
[10] K. Kiwiel. A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization , 1986 .
[11] Maddalena Nonato,et al. Applying Bundle Methods to the Optimization of Polyhedral Functions: An Applications-Oriented Development , 1995 .
[12] Jochem Zowe,et al. A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..
[13] Giorgio Gallo,et al. Lower bounds for the quadratic semi-assignment problem , 1986 .
[14] George L. Nemhauser,et al. Perspectives on optimization : a collection of expository articles , 1972 .
[15] G. Gallo,et al. A combined transportation and scheduling problem , 1997 .