default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Methods and Software , Volume 21
Volume 21, Number 1, 2006
- Lixing Han, Michael Neumann:
Effect of dimensionality on the Nelder-Mead simplex method. 1-16 - Katsuki Fujisawa
, Mituhiro Fukuda, Kazuhide Nakata:
Preprocessing sparse semidefinite programs via matrix completion. 17-39 - Ming-Jong Yao, Yu-Chun Wang:
A new algorithm for one-warehouse multi-retailer systems under stationary nested policy. 41-56
- Kartik Krishnan, John E. Mitchell:
A unifying framework for several cutting plane methods for semidefinite programming. 57-74
- Johnny Tak Wai Cheng, Shuzhong Zhang:
On implementation of a self-dual embedding method for convex programming. 75-103 - Hans D. Mittelmann, Armin Pruessner:
A server for automated performance analysis of benchmarking data. 105-120 - Arnd Rösch:
Error estimates for linear-quadratic control problems with control constraints. 121-134 - Karsten Eppler, Helmut Harbrecht:
Second-order shape optimization using wavelet BEM. 135-153 - Steven J. Benson, Todd S. Munson:
Flexible complementarity solvers for large-scale applications. 155-168
Volume 21, Number 2, 2006
- Mohammad Hadi Farahi, Hamed Hashemi Mehne, Akbar Hashemi Borzabadi:
Wing drag minimization by using measure theory. 169-177 - Hou-Duo Qi, Xiaoqi Yang:
Armijo Newton method for convex best interpolation. 179-200 - Arinbjörn Ólafsson, Stephen J. Wright:
Linear programing formulations and algorithms for radiotherapy treatment planning. 201-231 - Anthony J. Kearsley:
Matrix-free algorithm for the large-scale constrained trust-region subproblem. 233-245 - Zsolt Csizmadia, Tibor Illés:
New criss-cross type algorithms for linear complementarity problems with sufficient matrices. 247-266 - Juan Carlos de los Reyes:
Primal-dual active set method for control constrained optimal control of the Stokes equations. 267-293 - Masakazu Muramatsu:
A pivoting procedure for a class of second-order cone programming. 295-315 - Leonid Faybusovich, Thanasak Mouktonglang, Takashi Tsuchiya:
Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem. 315-341
Volume 21, Number 3, 2006
- P. Kaelo, M. M. Ali:
Probabilistic adaptations of point generation schemes in some global optimization algorithms. 343-357 - Ping Zhong, Masao Fukushima:
A new multi-class support vector algorithm. 359-372 - Igor V. Konnov:
Partial proximal point method for nonmonotone equilibrium problems. 373-384 - Regina Sandra Burachik, Claudia A. Sagastizábal, Susana Scheimberg:
An inexact method of partial inverses and a parallel bundle method. 385-400 - Kaj Holmberg, Krzysztof C. Kiwiel:
Mean value cross decomposition for nonlinear convex problems. 401-417 - Joo-Siong Chai, Kim-Chuan Toh:
Computation of condition numbers for linear programming problems using Peña's method. 419-443 - Alfio Borzì, Karl Kunisch:
A globalization strategy for the multigrid solution of elliptic optimal control problems. 445-459 - Jia-Yen Huang:
New search algorithm for solving the maintenance scheduling problem for a family of machines. 461-477 - Christopher John Price, Philippe L. Toint:
Exploiting problem structure in pattern search methods for unconstrained optimization. 479-491 - Samuel Burer, Changhui Choi:
Computational enhancements in low-rank semidefinite programming. 493-512
Volume 21, Number 4, 2006
- F. S. Bai, Zhi-You Wu, D. L. Zhu:
Lower order calmness and exact penalty function. 515-525
- Rafail N. Gasimov, Gürkan Öztürk:
Separation via polyhedral conic functions. 527-540 - Wei Li, Ping-Qi Pan, Guangting Chen:
Combined projected gradient algorithm for linear programming. 541-550 - Gui-Hua Lin, Masao Fukushima:
New reformulations for stochastic nonlinear complementarity problems. 551-564 - János D. Pintér, David Linder, Paulina Chin:
Global Optimization Toolbox for Maple: an introduction with illustrative applications. 565-582 - Farzad Safaei, Iradj Ouveysi:
Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation. 583-595 - Jie Sun, Zheng-Hai Huang:
A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution. 597-615 - Xiaoling Sun, Ning Ruan, Duan Li:
An efficient algorithm for nonlinear integer programming problems arising in series-parallel reliability systems. 617-633 - Jun Wu, Wuyi Yue, Yoshitsugu Yamamoto, Shouyang Wang:
Risk analysis of a pay to delay capacity reservation contract. 635-651 - Wenxing Zhu:
Globally concavized filled function method for the box constrained continuous global minimization problem. 653-666 - Florian A. Potra, Xing Liu:
Erratum: predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. 677-678
Volume 21, Number 5, 2006
- H. W. Joseph Lee, K. H. Wong:
Semi-infinite programming approach to nonlinear time-delayed optimal control problems with linear continuous constraints. 679-691 - Vaithilingam Jeyakumar, John T. Ormerod, Robert S. Womersley:
Knowledge-based semidefinite linear programming classifiers. 693-706 - Weijun Zhou, Li Zhang:
A nonlinear conjugate gradient method based on the MBFGS secant condition. 707-714 - R. Baker Kearfott:
Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization. 715-731 - Csaba Mészáros:
Sparsity in convex quadratic programming with interior point methods. 733-745 - Etienne Emmrich, Horst Schmitt:
Numerical treatment of a class of optimal control problems arising in economics. 747-767 - Jean-Pierre Dussault, Benoit Hamelin:
Robust descent in differentiable optimization using automatic finite differences. 769-777 - Juan A. Gómez, Walter Gómez:
Cutting plane algorithms for robust conic convex optimization problems. 779-803 - Yong Xia, Ya-Xiang Yuan:
A new linearization method for quadratic assignment problems. 805-818 - Keyvan Amini, Nezam Mahdavi-Amiri:
Solving rank one perturbed linear Diophantine systems by the ABS method. 819-831 - Indraneel Das:
An active set quadratic programming algorithm for real-time model predictive control. 833-849 - Antoine Deza, Eissa Nematollahi, M. Reza Peyghami, Tamás Terlaky:
The central path visits all the vertices of the Klee-Minty cube. 851-865
Volume 21, Number 6, 2006
- Ekaterina A. Kostina, Hubert Schwetlick:
Foreword. 867-868
- Tobias Gänzler, Stefan Volkwein, Martin Weiser:
SQP methods for parameter identification problems arising in hyperthermia. 869-887 - Ilia Gherman, Volker Schulz, J. T. Betts:
Optimal flight trajectories for the validation of aerodynamic models. 889-900 - Marc Daniel Haunschild, Sebastian Aljoscha Wahl, Bernd Freisleben, Wolfgang Wiechert:
A general framework for large-scale model selection. 901-917 - Richard W. Longman, Minh Q. Phan:
Iterative learning control as a method of experiment design for improved system identification. 919-941 - Michael R. Osborne:
Least squares methods in maximum likelihood problems. 943-959 - Fasma Diele, Carmela Marangi, Stefania Ragni:
Coupling quadrature and continuous Runge-Kutta methods for optimal control problems. 961-975 - Anthony J. Kearsley:
Algorithms for optimal signal set design. 977-994
- Oleg A. Prokopyev:
Book review. 995-996
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 2026-08-06 22:40 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
