Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Methods and Software , Volume 17
Volume 17, Number 1, 2002
- Marko Mäkelä:
Survey of Bundle Methods for Nonsmooth Optimization. 1-29 - Adil M. Bagirov
:
A Method for Minimization of Quasidifferentiable Functions. 31-60 - Jianzhong Zhang, Zhenhong Liu:
An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems. 61-75 - Stefan Volkwein:
Mesh-Independence of Lagrange-SQP Methods with Lipschitz-Continuous Lagrange Multiplier Updates. 77-111 - Marco Gaviano, Daniela Lera:
A Complexity Analysis of Local Search Algorithms in Global Optimization. 113-127 - Christèle Faure:
Adjoining Strategies for Multi-layered Programs. 129-164
Volume 17, Number 2, 2002
- Alexander B. Kurzhanski, Pravin Varaiya:
On Ellipsoidal Techniques for Reachability Analysis. Part I: External Approximations. 177-206 - Alexander B. Kurzhanski, Pravin Varaiya:
On Ellipsoidal Techniques for Reachability Analysis. Part II: Internal Approximations Box-valued Constraints. 207-237 - Murat Subasi:
Optimal Control of Heat Source in a Heat Conductivity Problem. 239-250 - Klaus Beer, Viktor A. Skokov:
Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints. 251-269 - Igor V. Konnov:
A Combined Relaxation Method for Nonlinear Variational Inequalities. 271-292 - Michael Doumpos, Constantin Zopounidis:
On the Development of an Outranking Relation for Ordinal Classification Problems: An Experimental Investigation of a New Methodology. 293-317 - John W. Chinneck:
Discovering the Characteristics of Mathematical Programs via Sampling. 319-352
Volume 17, Number 3, 2002
- Patrizia Beraldi, Andrzej Ruszczynski:
A branch and bound method for stochastic integer problems under probabilistic constraints. 359-382 - Jörgen Blomvall, Per Olov Lindberg:
A Riccati-based primal interior point solver for multistage stochastic programming - extensions. 383-407 - József Bukszár, Tamás Szántai:
Probability bounds given by hypercherry trees. 409-422 - Christian Condevaux-Lanloy, Emmanuel Fragnière, Alan King:
SISP: Simplified interface for stochastic programmingEstablishing a Hard Link between Mathematical Programming Modeling Languages and SMPS Codes. 423-443 - Csaba I. Fábián, András Prékopa, Olga Ruf-Fiedler:
On a dual method for a specially structured linear programming problem with application to stochastic programming. 445-492 - Sjur Didrik Flåm:
Stochastic programming, cooperation, and risk exchange. 493-504 - Riho Lepp:
Approximation of the quantile minimization problem with decision rules. 505-522 - Alexander Shapiro, Anton J. Kleywegt:
Minimax analysis of stochastic problems. 523-542 - Béla Vizvári:
The integer programming background of a stochastic integer programming algorithm of dentcheva-prékopa-ruszczyński. 543-559
Volume 17, Number 4, 2002
- Maria Grazia Gasparo, Sandra Pieraccini, Alessandro Armellini:
An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps. 561-586 - Zong-wu Zhu:
A Modified Trust Region Algorithm. 587-604 - Hiroshige Dan, Nobuo Yamashita, Masao Fukushima:
Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions. 605-626 - Francesca Guerriero, Marco Mancini, Roberto Musmanno:
New Rollout Algorithms for Combinatorial Optimization Problems. 627-654 - Bao-Zhu Guo:
Riesz Basis Approach to the Tracking Control of a Flexible Beam with a Tip Rigid Body without Dissipativity. 655-681 - Dexuan Xie, Tamar Schlick:
A More Lenient Stopping Rule for Line Search Algorithms. 683-700 - Brian J. Driessen, Nader Sadegh:
Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming. 701-716 - Sungmook Lim, Soondal Park:
LPAKO: A Simplex-based Linear Programming Program. 717-745
Volume 17, Number 5, 2002
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan:
Generating dual-bounded hypergraphs. 749-781 - Alexey V. Demyanov, Vladimir F. Demyanov, Vasily N. Malozemov:
Minmaxmin problems revisited. 783-804 - Jean-Louis Goffin, Jean-Philippe Vial:
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. 805-867 - Andreas Griewank, Andrea Walther:
On constrained optimization by adjoint based quasi-Newton methods. 869-889 - Abdel-Rahman Hedar, Masao Fukushima:
Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization. 891-912 - O. L. Mangasarian:
A finite newton method for classification. 913-929 - Alex M. Rubinov, X. Q. Yang, Adil M. Bagirov:
Penalty functions with a small penalty parameter. 931-964 - Mikhail V. Solodov, Benar Fux Svaiter:
A new proximal-based globalization strategy for the Josephy-Newton method for variational inequalities. 965-983
Volume 17, Number 6, 2002
- Yan-Qin Bai, Cees Roos, Mohamed El Ghami:
A primal-dual interior-point method for linear optimization based on a new proximity function. 985-1008 - Michael C. Ferris, Meta M. Voelker:
Slice models in general purpose modeling systems: An application to DEA. 1009-1032 - Paola Festa, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro:
Randomized heuristics for the Max-Cut problem. 1033-1058 - Gianpaolo Ghiani, Lucio Grandinetti, Francesca Guerriero, Roberto Musmanno:
A Lagrangean heuristic for the plant location problem with multiple facilities in the same site. 1059-1076 - Jiming Peng, Tamás Terlaky:
A dynamic large-update primal-dual interior-point method for linear optimization. 1077-1104 - Jos F. Sturm:
Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. 1105-1154
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-07-17 21:16 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:
