default search action
Computational Optimization and Applications, Volume 1
Volume 1, Number 1, October 1992
- William W. Hager:
Editorial. 5 - Dimitri P. Bertsekas:
Auction algorithms for network flow problems: A tutorial introduction. 7-66 - Steven A. Gabriel, Jong-Shi Pang:
An inexact NE/SQP method for solving the nonlinear complementarity problem. 67-91 - Masao Fukushima:
Application of the alternating direction method of multipliers to separable convex programming problems. 93-111 - F.-S. Kupfer, Ekkehard W. Sachs:
Numerical solution of a nonlinear parabolic control problem by a reduced SQP method. 113-135
Volume 1, Number 2, November 1992
- Irvin J. Lustig
, Guangye Li:
An implementation of a parallel primal-dual interior point method for block-structured linear programs. 141-161 - Yong Li, Panos M. Pardalos:
Generating quadratic assignment test problems with known optimal permutations. 163-184 - Ciyou Zhu:
Modified proximal point algorithm for extended linear-quadratic programming. 185-205 - Satoru Ibaraki, Masao Fukushima, Toshihide Ibaraki:
Primal-dual proximal point algorithm for linearly constrained convex programming problems. 207-226 - Hiroshi Konno, Takahito Kuno, Yasutoshi Yajima:
Parametric simplex algorithms for a class of NP-Complete problems whose average number of steps is polynomial. 227-239
Volume 1, Number 3, December 1992
- John R. Birge
Efficient solution of two-stage stochastic linear programs using interior point methods. 245-276 - Dimitri P. Bertsekas, David A. Castañón:
A forward/reverse auction algorithm for asymmetric assignment problems. 277-297 - Luís Nunes Vicente
Generation of disjointly constrained bilinear programming test problems. 299-306 - Dan Butnariu, Abraham Mehrez:
Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems. 307-326 - Herbert Fischer:
Automatic differentiation: Reduced gradient and reduced Hessian matrix. 327-344
Volume 1, Number 4, April 1993
- William W. Hager, Donald W. Hearn:
Application of the dual active set algorithm to quadratic network optimization. 349-373 - Søren S. Nielsen, Stavros A. Zenios
Proximal minimizations with D-functions and the massively parallel solution of linear network programs. 375-398 - José H. Dulá:
Designing a majorization scheme for the recourse function in two-stage stochastic linear programming. 399-414 - J. J. Bisschop, C. A. C. Kuip:
Hierarchical sets in mathematical programming modeling languages. 415-438
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.
last updated on 2024-12-15 01:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: