default search action
Mathematical Programming, Volume 25
Volume 25, Number 1, January 1983
- Bruce A. Murtagh, Fawzy Soliman:
Subgradient optimization applied to a discrete nonlinear problem in engineering design. 1-12 - Awi Federgruen, Paul H. Zipkin:
Solution techniques for some allocation problems. 13-24 - A. Kalliauer:
An algorithm for hierarchical optimization of large-scale problems with nested structure. 25-45 - Tony J. Van Roy:
Cross decomposition for mixed integer programming. 46-63 - Richard Grinold:
Convex infinite horizon programs. 64-82 - Samuel A. Awoniyi, Michael J. Todd:
An efficient simplicial algorithm for computing a zero of a convex union of smooth functions. 83-108 - Sanjo Zlobec:
Characterizing an optimal input in perturbed convex programming. 109-121 - Philip C. Jones:
A note on the Talman, Van der Heyden linear complementarity algorithm. 122-124 - Robert B. Schnabel, Philippe L. Toint:
Forcing sparsity by projecting with respect to a non-diagonally weighted frobenius norm. 125-129
Volume 25, Number 2, June 1983
- Masakazu Kojima, Shinji Mizuno:
Computation of all solutions to a system of polynomial equations. 131-157 - Mukund N. Thapa:
Optimization of unconstrained functions with sparse Hessian matrices - Quasi-Newton methods. 158-182 - Colin McDiarmid:
Integral decomposition in polyhedra. 183-198 - J. Randall Brown:
The flow circulation sharing problem. 199-227 - Refael Hassin:
The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm. 228-239 - Jacob Ponstein:
Comments on the general duality survey by J. Tind and L.A. Wolsey. 240-244
Volume 25, Number 3, October 1983
- Robert Fourer:
Solving staircase linear programs by the simplex method, 2: Pricing. 251-292 - Shih-Ping Han, Olvi L. Mangasarian:
A dual differentiable exact penalty function. 293-306 - Jean-Jacques Strodiot, Van Hien Nguyen, Norbert Heukemes:
ε-Optimal solutions in nondifferentiable convex programming and some related questions. 307-328 - Yoshitsugu Yamamoto:
A new variable dimension algorithm for the fixed point problem. 329-342 - Johannes Jahn:
Duality in vector optimization. 343-353 - Michael J. Best, Richard J. Caron:
A method to increase the computational efficiency of certain quadratic programming algorithms. 354-358 - Elon Kohlberg:
Consistency of finite systems of convex inequalities. 359-362 - Gerard van der Laan, A. J. J. Talman:
Note on the path following approach of equilibrium programming. 363-367
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.