default search action
Computational Optimization and Applications, Volume 46
Volume 46, Number 1, May 2010
- Kartik Krishnan Sivaramakrishnan:
A parallel interior point decomposition algorithm for block angular semidefinite programs. 1-29 - Qinggang Wang, Jinling Zhao, Qingzhi Yang:
Some non-interior path-following methods based on a scaled central path for linear complementarity problems. 31-49 - N. Cherfi, Mhand Hifi:
A column generation method for the multiple-choice multi-dimensional knapsack problem. 51-73 - Yu. G. Stoyan
, V. N. Patsuk:
Covering a compact polygonal set by identical circles. 75-92 - Kirsten Morris, Carmeliza Navasca:
Approximation of low rank solutions for linear quadratic control of partial differential equations. 93-111 - Yuichi Takano, Jun-ya Gotoh:
α-Conservative approximation for probabilistically constrained convex programs. 113-133 - Lino J. Alvarez-Vázquez
Multi-objective Pareto-optimal control: an application to wastewater management. 135-157 - Xiaoning Shen, Yu Guo, Qingwei Chen, Weili Hu:
A multi-objective optimization evolutionary algorithm incorporating preference information based on fuzzy logic. 159-188
Volume 46, Number 2, June 2010
- Ernesto G. Birgin
Preface. 189-191 - Charles Audet, John E. Dennis Jr., Sébastien Le Digabel
Globalization strategies for Mesh Adaptive Direct Search. 193-215 - Lenys Bello, William La Cruz
Residual algorithm for large-scale positive definite generalized eigenvalue problems. 217-227 - Emerson V. Castelani, André L. M. Martinez
Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians. 229-245 - José Yunier Bello Cruz
Convergence of direct methods for paramonotone variational inequalities. 247-263 - Ana Luísa Custódio, Humberto Rocha
Incorporating minimum Frobenius norm models in direct search. 265-278 - Jonathan Eckstein, Paulo J. S. Silva
Proximal methods for nonlinear programming: double regularization and inexact subproblems. 279-304 - Grégory Emiel, Claudia A. Sagastizábal
Incremental-like bundle methods with application to energy planning. 305-332 - Andreas Fischer
A new line search inexact restoration approach for nonlinear programming. 333-346 - Alexey F. Izmailov, Mikhail V. Solodov:
Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization. 347-368 - Miles Kumaresan, Natasa Krejic
A model for optimal execution of atomic orders. 369-389
Volume 46, Number 3, July 2010
- Churlzu Lim
Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization. 391-415 - Hiroshi Konno, Yoshihiro Takaya:
Multi-step methods for choosing the best set of variables in regression analysis. 417-426 - João Claro
A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem. 427-450 - Maria Daneva, Torbjörn Larsson
A comparison of feasible direction methods for the stochastic transportation problem. 451-466 - Francesco Rinaldi
Concave programming for minimizing the zero-norm over polyhedral sets. 467-486 - Michael Hinze
Variational discretization of Lavrentiev-regularized state constrained elliptic optimal control problems. 487-510 - R. H. W. Hoppe, Michael Kieweg:
Adaptive finite element methods for mixed control-state constrained optimal control problems for elliptic boundary value problems. 511-533 - Michael Hintermüller
A shape and topology optimization technique for solving a class of linear complementarity problems in function space. 535-569
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-11-22 19:43 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: