default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 30
Volume 30, Number 1, September 1984
- Egon Balas, Joseph B. Mazzola:
Nonlinear 0-1 programming: I. Linearization techniques. 1-21 - Egon Balas, Joseph B. Mazzola:
Nonlinear 0-1 programming: II. Dominance relations and algorithms. 22-45 - Arie Hordijk, Lodewijk C. M. Kallenberg:
Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints. 46-70 - Michael J. Best:
Equivalence of some quadratic programming algorithms. 71-87 - József Beck, Joel Spencer:
Integral approximation sequences. 88-98 - Larry Nazareth:
An alternative variational principle for variable metric updating. 99-104 - Patrick T. Harker:
A variational inequality approach for the determination of oligopolistic market equilibrium. 105-111 - Mustafa Akgül:
On polyhedral extension of some LP theorems. 112-120
Volume 30, Number 2, October 1984
- Ury Passy, Eliezer Z. Prisman:
Conjugacy in quasi-convex programming. 121-146 - Jean-Louis Goffin:
Variable metric relaxation methods, part II: The ellipsoid method. 147-162 - Masao Fukushima:
A descent algorithm for nonsmooth convex optimization. 163-175 - Philip E. Gill, Nicholas I. M. Gould
, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A weighted gram-schmidt method for convex quadratic programming. 176-195 - Gerard van der Laan, L. P. Seelen:
Efficiency and implementation of simplicial zero point algorithms. 196-217 - Jan Mandel:
Convergence of the cyclical relaxation method for linear inequalities. 218-228 - Donald M. Topkis:
Adjacency on polymatroids. 229-237 - Jean-Charles Pomerol:
A note on limiting infisup theorems. 238-241
Volume 30, Number 3, October 1984
- Per Olov Lindberg, Snjólfur Ólafsson:
On the length of simplex paths: The assignment case. 243-260 - Dominique de Werra:
A decomposition property of polyhedra. 261-266 - Roger Fletcher, S. P. J. Matthews:
Stable modification of explicitLU factors for simplex updates. 267-284 - Renato De Leone, Manlio Gaudioso, Luigi Grippo:
Stopping criteria for linesearch methods without derivatives. 285-300 - Yoshitsugu Yamamoto:
A variable dimension fixed point algorithm and the orientation of simplices. 301-312 - Jerzy A. Filar:
On stationary equilibria of a single-controller stochastic game. 313-325 - R. Chandrasekaran, Arie Tamir:
Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games. 326-339 - Eric Rosenberg:
Exact penalty functions and stability in locally Lipschitz programming. 340-356 - Michael Bastian:
Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage. 357-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 2025-12-04 01:36 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:
