default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 87
Volume 87, Number 1, January 2000
- Liqun Qi, Defeng Sun
, Guanglu Zhou:
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. 1-35 - Alberto Caprara, Matteo Fischetti, Adam N. Letchford:
On the separation of maximally violated mod- k cuts. 37-56 - Philip J. Neame, Natashia Boland, Daniel Ralph:
An outer approximate subdifferential method for piecewise affine optimization. 57-86 - William H. Cunningham, Yaoguang Wang:
Restricted 2-factor polytopes. 87-111 - James V. Burke, Song Xu:
A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem. 113-130 - Charles Audet, Pierre Hansen, Brigitte Jaumard, Gilles Savard:
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. 131-152 - Stephen C. Billups:
Improving the robustness of descent-based methods for semismooth equations using proximal perturbations. 153-175 - Peter A. Beling, Sushil Verma:
A probabilistic analysis of a measure of combinatorial complexity for the central curve. 177-187 - Mikhail V. Solodov, Benar Fux Svaiter:
Forcing strong convergence of proximal point iterations in a Hilbert space. 189-202
Volume 87, Number 2, April 2000
- K. A. Ariyawansa, R. B. Mifflin, John L. Nazareth:
Studies in algorithmic optimization: Festschrift in Honor of William C. Davidon. 203-207 - C. G. Broyden:
On the discovery of the "good Broyden" method. 209-213 - Andrew R. Conn, Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
A primal-dual trust-region algorithm for non-convex nonlinear programming. 215-249 - Roger Fletcher:
Stable reduced Hessian updates for indefinite quadratic programming. 251-264 - John Greenstadt:
Reminiscences on the development of the variational approach to Davidon's variable-metric method. 265-280 - M. J. D. Powell:
On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables. 281-301 - David F. Shanno, Robert J. Vanderbei:
Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods. 303-316 - Michael Wagner, Michael J. Todd:
Least-change quasi-Newton updates for equality-constrained optimization. 317-350
Volume 87, Number 3, May 2000
- Javier Peña, James Renegar:
Computing approximate solutions for convex conic systems of constraints. 351-383 - Francisco Barahona, Ranga Anbil:
The volume algorithm: producing primal solutions with a subgradient method. 385-399 - Le Thi Hoai An:
An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints. 401-426 - Mourad Baïou, Michel Balinski:
The stable admissions polytope. 427-439 - Xiaotie Deng, Toshihide Ibaraki, Hiroshi Nagamochi, Wenan Zang:
Totally balanced combinatorial optimization games. 441-452 - Shuzhong Zhang:
Quadratic maximization and semidefinite relaxation. 453-465 - Gianpaolo Ghiani, Gilbert Laporte:
A branch-and-cut algorithm for the Undirected Rural Postman Problem. 467-481 - Ulrich Faigle, Walter Kern:
On the core of ordered submodular cost games. 483-499 - Song Xu:
The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P -functions. 501-517 - Vladimir G. Deineko, Gerhard J. Woeginger:
A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem. 519-542 - Serpil Sayin:
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. 543-560 - Ya-Xiang Yuan:
On the truncated conjugate gradient method. 561-573
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-02-13 00:38 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:
