Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Methods and Software, Volume 24
Volume 24, Number 1, 2009
- Isabelle Charpentier
, Jean Utke:
Fast higher-order derivative tensors with Rapsodia. 1-14 - Marco Baglietto, Marcello Sanguineti, Riccardo Zoppoli:
The extended Ritz method for functional optimization: overview and applications to single-person and team optimal decision problems. 15-43 - Osman Güler, Filiz Gürtuna, Olena Shevchenko:
Duality in quasi-Newton methods and new variational characterizations of the DFP and BFGS updates. 45-62 - Aleksey K. Alekseev, I. Michael Navon, Jeff L. Steward:
Comparison of advanced large-scale minimization algorithms for the solution of inverse ill-posed problems. 63-87 - Neculai Andrei:
Another nonlinear conjugate gradient algorithm for unconstrained optimization. 89-104 - Radu Serban:
A parallel computational model for sensitivity analysis in optimization for robustness. 105-121 - Zhaosong Lu, Renato D. C. Monteiro, Jerome W. O'Neal:
An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners. 123-143 - Giovanni Fasano, José Luis Morales, Jorge Nocedal:
On the geometry phase in model-based algorithms for derivative-free optimization. 145-154
- Panos M. Pardalos:
Approximate dynamic programming: solving the curses of dimensionality. 155
Volume 24, Number 2, 2009
- Timo Aittokoski, Sami Äyrämö, Kaisa Miettinen:
Clustering aided approach for decision making in computationally expensive multiobjective optimization. 157-174 - Robin C. Gilbert, Theodore B. Trafalis:
Quadratic programming formulations for classificationand regression. 175-185 - Pablo Guerrero-García, Ángel Santos-Palomo:
A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides' primal-dual simplex-type algorithm. 187-204 - Ronald H. W. Hoppe, Svetozara I. Petrova:
Path-following methods for shape optimal design of periodic microstructural materials. 205-218 - Maria Macconi, Benedetta Morini, Margherita Porcelli:
A Gauss-Newton method for solving bound-constrained underdetermined nonlinear systems. 219-235 - Andreas Potschka, Hans Georg Bock, Johannes P. Schlöder:
A minima tracking variant of semi-infinite programming for the treatment of path constraints within direct solution of optimal control problems. 237-252 - Ana Maria A. C. Rocha, Edite M. G. P. Fernandes:
Modified movement force vector in an electromagnetism-like mechanism for global optimization. 253-270 - Georgi V. Smirnov, Vera Sá:
On the linear convergence of Newton-Krylov methods. 271-283 - Nadezda Sukhorukova, Julien Ugon, John Yearwood:
Workload coverage through nonsmooth optimization. 285-298 - Philippe L. Toint, Dimitri Tomanos, M. Weber-Mendonça:
A multilevel algorithm for solving the trust-region subproblem. 299-311
Volume 24, Number 3, 2009
- Johan Löfberg:
Dualize it: software for automatic primal and dual conversions of conic programs. 313-325 - Qing Xu, Xi Dai, Bo Yu:
Solving generalized Nash equilibrium problem with equality and inequality constraints. 327-337 - Shao-Jian Qu, Qingpu Zhang, Su-Da Jiang:
A nonmonotone quasi-Newton trust-region method of conic model for unconstrained optimization. 339-367 - Roman A. Polyak:
On the local quadratic convergence of the primal-dual augmented Lagrangian method. 369-379 - Almir Mutapcic, Stephen P. Boyd:
Cutting-set methods for robust convex optimization with pessimizing oracles. 381-406 - Hiroshi Yamashita, Hiroshi Yabe:
A primal-dual interior point method for nonlinear optimization over second-order cones. 407-426 - Agnes Dittel, Armin Fügenschuh, Simone Göttlich, Michael Herty:
MIP presolve techniques for a PDE-based supply chain model. 427-445 - Sheng-Long Hu, Zheng-Hai Huang, Ping Wang:
A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems. 447-460 - João P. M. Gonçalves, Robert H. Storer, Jacek Gondzio:
A family of linear programming algorithms based on an algorithm by von Neumann. 461-478
Volume 24, Numbers 4-5, 2009
- Nikolaos V. Sahinidis:
Global optimization. 479-482
- Xiaowei Bao, Nikolaos V. Sahinidis, Mohit Tawarmalani:
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. 485-504 - Andreas Lundell, Tapio Westerlund:
Convex underestimation strategies for signomial functions. 505-522 - Samuel Burer, Jieqiu Chen:
A p-cone sequential relaxation procedure for 0-1 integer programs. 523-548 - Joaquim João Júdice, Hanif D. Sherali, Isabel M. Ribeiro, Silvério S. Rosa:
On the asymmetric eigenvalue complementarity problem. 549-568 - Wei Wang, Archis Ghate, Zelda B. Zabinsky:
Adaptive parameterized improving hit-and-run for global optimization. 569-594
- Pietro Belotti, Jon Lee, Leo Liberti, François Margot, Andreas Wächter:
Branching and bounds tighteningtechniques for non-convex MINLP. 597-634 - Zsolt Ugray, Leon S. Lasdon, John C. Plummer, Michael R. Bussieck:
Dynamic filters and randomized drivers for the multi-start global optimization algorithm MSNLP. 635-656 - Youdong Lin, Linus Schrage:
The global solver in the LINDO API. 657-668 - A. Ismael F. Vaz, Luís Nunes Vicente:
PSwarm: a hybrid solver for linearly constrained global derivative-free optimization. 669-685 - R. Baker Kearfott:
GlobSol user guide. 687-708 - Yahia Lebbah:
ICOS: a branch and bound based solver for rigorous global optimization. 709-726 - Ferenc Domes:
GLOPTLAB: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems. 727-747 - László Pál, Tibor Csendes:
INTLAB implementation of an interval global optimization algorithm. 749-759 - Didier Henrion, Jean-Bernard Lasserre, Johan Löfberg:
GloptiPoly 3: moments, optimization and semidefinite programming. 761-779
- João M. Natali, José Mauricio Pinto:
Piecewise polynomial interpolations and approximations of one-dimensional functions through mixed integer linear programming. 783-803 - Miguel F. Anjos, Ginger Yen:
Provably near-optimal solutions for very large single-row facility layout problems. 805-817 - Andrea Cassioli, Marco Locatelli, Fabio Schoen:
Global optimization of binary Lennard-Jones clusters. 819-835 - Scott R. McAllister, Christodoulos A. Floudas:
Enhanced bounding techniques to reduce the protein conformational search space. 837-855 - Dale Henderson, J. Cole Smith:
An exact reformulation-linearisation technique algorithm for solving a parameter extraction problem arising in compact thermal models. 857-870
Volume 24, Number 6, 2009
- Cosmin G. Petra, Bogdan I. Gavrea, Mihai Anitescu, Florian A. Potra:
A computational study of the use of an optimization-based method for simulating large multibody systems. 871-894 - Giancarlo Bigi, Marco Castellani, Massimo Pappalardo:
A new solution method for equilibrium problems. 895-911 - Shuisheng Zhou, Hongwei Liu, Feng Ye, Li-Hua Zhou:
A new iterative algorithm training SVM. 913-932 - Xiaojiao Tong, Felix F. Wu, Liqun Qi:
Worst-case CVaR based portfolio optimization models with applications to scenario planning. 933-958 - Etienne de Klerk, Renata Sotirov:
A new library of structured semidefinite programming instances. 959-971 - L. E. Torres Guardia, A. Parracho Sant'Anna:
A separable nonlinear model for the multicommodity flow problem. 973-987
- Paola Festa:
Cooperative networks, control and optimization. 989-992
a service of 
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-04-17 20:31 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
