default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 36
Volume 36, Number 1, October 1986
- Gianni Di Pillo
, Luigi Grippo:
An exact penalty function method with global convergence properties for nonlinear programming problems. 1-18 - José Herskovits:
A two-stage feasible directions algorithm for nonlinear constrained optimization. 19-38 - Carl Brezovec, Gérard Cornuéjols, Fred W. Glover:
Two algorithms for weighted matroid intersection. 39-53 - Jong-Shi Pang:
Inexact Newton methods for the nonlinear complementarity problem. 54-71 - Achiya Dax:
A note on optimality conditions for the Euclidean. Multifacility location problem. 72-80 - Olvi L. Mangasarian, Tzong-Huei Shiau:
Error bounds for monotone linear complementarity problems. 81-89 - Jean-Pierre Dussault, Jacques A. Ferland, Bernard Lemaire:
Convex quadratic programming with one constraint and bounded variables. 90-104 - Jerzy Kyparisis:
Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems. 105-113 - Horst A. Eiselt:
Continuous maximin knapsack problems with GLB constraints. 114-121
Volume 36, Number 2, June 1986
- András Sebö:
Finding the t -join structure of graphs. 123-134 - Ding-Zhu Du, Xiang-Sun Zhang:
A convergence theorem of Rosen's gradient projection method. 135-144 - Douglas Salane:
Symmetric minimum-norm updates for use in gibbs free energy calculations. 145-156 - Francisco Barahona, Ali Ridha Mahjoub:
On the cut polytope. 157-173 - Earl R. Barnes:
A variation on Karmarkar's algorithm for solving linear programming problems. 174-182 - Philip E. Gill, Walter Murray, Michael A. Saunders, John A. Tomlin, Margaret H. Wright:
On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. 183-209 - Amedeo Premoli:
Piecewise-linear programming: The compact (CPLP) algorithm. 210-227 - William H. Cunningham, Jan Green-Krótki:
Dominants and submissives of matching polyhedra. 228-237
Volume 36, Number 3, October 1986
- Colin McDiarmid:
On the greedy algorithm with random costs. 245-255 - Albert G. Buckley:
Long vectors for quasi-Newton updates. 256-275 - Shu-Cherng Fang, J. R. Rajasekera:
Controlled perturbations for quadratically constrained quadratic programs. 276-289 - Philippe L. Toint:
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization. 290-306 - Marco A. Duran, Ignacio E. Grossmann:
An outer-approximation algorithm for a class of mixed-integer nonlinear programs. 307-339 - Immo Diener:
Trajectory nets connecting all critical points of a smooth function. 340-352 - Marvin D. Troutt:
A stability concept for matrix game optimal strategies and its application to linear programming sensitivity analysis. 353-361
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-11-22 19:45 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:
