default search action
Computational Optimization and Applications, Volume 5
Volume 5, Number 1, January 1996
- Masao Fukushima, Mounir Haddou, Hien Nguyen, Jean-Jacques Strodiot, Takanobu Sugimoto, Eiki Yamakawa:
A parallel descent algorithm for convex programming. 5-37 - Reiner Horst, Nguyen V. Thoai:
A new algorithm for solving the general quadratic programming problem. 39-48 - Luís M. Fernandes, Joaquim Júdice, João Patrício:
An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems. 49-77 - M. R. Emamy-K, A. I. Ramírez:
A special class of set covering problems. 79-88
Volume 5, Number 2, March 1996
- O. L. Mangasarian:
Dedication. 95-96 - Chunhui Chen, O. L. Mangasarian:
A class of smoothing functions for nonlinear and mixed complementarity problems. 97-138 - Jong-Shi Pang, Jeffrey C. Trinkle, Grace Lo:
A complementarity approach to a quasistatic multi-rigid-body contact problem. 139-154 - Carl Geiger, Christian Kanzow:
On the resolution of monotone complementarity problems. 155-173 - Anna Altman, Krzysztof C. Kiwiel:
A note on some analytic center cutting plane methods for convex feasibility and minimization problems. 175-180
Volume 5, Number 3, May 1996
- Didier El Baz:
Asynchronous gradient algorithms for a class of convex separable network flow problems. 187-205 - Ali Bouaricha:
Tensor-Krylov methods for large nonlinear equations. 207-232 - Asen L. Dontchev, Ilya V. Kolmanovsky:
Best interpolation in a strip II: Reduction to unconstrained convex optimization. 233-251 - Kazimierz Malanowski, Helmut Maurer:
Sensitivity analysis for parametric control problems with control-state constraints. 253-283
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.