default search action
Journal of Global Optimization, Volume 50
Volume 50, Number 1, May 2011
- Juan Enrique Martínez-Legaz
, Wilfredo Sosa Sandoval
Preface. 1-2 - Adil M. Bagirov
Codifferential method for minimizing nonsmooth DC functions. 3-22 - Stephen Simons:
SSDB spaces and maximal monotonicity. 23-37 - Francisco Facchinei
Partial penalization for the solution of generalized Nash equilibrium problems. 39-57 - Alfredo N. Iusem, Mostafa Nasri:
Korpelevich's method for variational inequality problems in Banach spaces. 59-76 - Julian P. Revalski, N. V. Zhivkov:
Small sets in best approximation theory. 77-91 - Didier Aussel, John Edwin Cotrina:
Semicontinuity of the solution map of quasivariational inequalities. 93-105 - Hans Keiding:
Maximizing selections from the core of a cooperative game. 107-118 - Pando G. Georgiev, Panos M. Pardalos:
Generalized Nash equilibrium problems for lower semi-continuous strategy maps. 119-125 - Laia Ferrer-Martí
Optimizing microwind rural electrification projects. A case study in Peru. 127-143 - Francisco J. Aragón Artacho
Enhanced metric regularity and Lipschitzian properties of variational systems. 145-167 - Eladio Ocaña Anaya
Transversality condition for singular infinite horizon calculus of variations. 169-178
Volume 50, Number 2, June 2011
- Lyudmila N. Polyakova
On global unconstrained minimization of the difference of polyhedral functions. 179-195 - Barbora Benesová
Global optimization numerical strategies for rate-independent processes. 197-220 - Yu Miao, Luming Shen:
Convergence of iterates with errors of semicontractive mappings. 221-227 - Hongjie Du, Weili Wu, Wonjun Lee, Qinghai Liu, Zhao Zhang, Ding-Zhu Du:
On minimum submodular cover with submodular cost. 229-234 - Mahide Küçük, Mustafa Soyertem, Yalçin Küçük:
On constructing total orders and solving vector optimization problems with total orders. 235-247 - Paluri S. V. Nataraj, Shanta Sondur
The extrapolated interval global optimization algorithm. 249-270 - Ahmed Taa:
Second-order conditions for nonsmooth multiobjective optimization problems with inclusion constraints. 271-291 - Yongjian Yang, Fusheng Bai:
An integral function and vector sequence method for unconstrained global optimization. 293-311 - Somyot Plubtieng, Tipphawan Thammathiwat:
A viscosity approximation method for finding a common solution of fixed points and equilibrium problems in Hilbert spaces. 313-327 - Carlile Lavor
On the computation of protein backbones by using artificial backbones of hydrogens. 329-344 - Joe Naoum-Sawaya
Controlled predatory pricing in a multiperiod Stackelberg game: an MPEC approach. 345-362 - Charles Audet, Pierre Hansen, Sylvain Perron:
Remarks on solutions to a nonconvex quadratic programming test problem. 363-369
Volume 50, Number 3, July 2011
- Hoang Tuy:
A new topological minimax theorem with application. 371-378 - Zhi-You Wu, Duan Li
Global descent methods for unconstrained global optimization. 379-396 - Matthias Ehrgott
An approximation algorithm for convex multi-objective programming problems. 397-416 - Weihang Zhu
Massively parallel differential evolution - pattern search optimization with graphics hardware acceleration: an investigation on bound constrained optimization problems. 417-437 - Peiping Shen, Yuan Ma, Yongqiang Chen:
Global optimization for the generalized polynomial sum of ratios problem. 439-455 - Zi-Ming Wang
A new iterative algorithm for equilibrium and fixed point problems of nonexpansive mapping. 457-472 - Chao-Lin Chen:
Maximum information stored in a labeled connected network with minimum edges. 473-483 - Radu Ioan Bot, Delia-Maria Nechita:
On the Dini-Hadamard subdifferential of the difference of two functions. 485-502 - Thiago F. Noronha, Mauricio G. C. Resende, Celso C. Ribeiro
A biased random-key genetic algorithm for routing and wavelength assignment. 503-518 - Vsevolod I. Ivanov
Second-order Kuhn-Tucker invex constrained problems. 519-529 - Fenghui Wang
A note on the regularized proximal point algorithm. 531-535 - Mircea Balaj:
Alternative principles and their applications. 537-547 - Sanjo Zlobec:
Equivalent formulations of the gradient. 549-553
Volume 50, Number 4, August 2011
- M. Montaz Ali
Preface: Special issue SAGO08. 555-556 - Juana López Redondo
Parallel algorithms for continuous multifacility competitive location problems. 557-573 - Jiaqiao Hu, Hyeong Soo Chang, Michael C. Fu, Steven I. Marcus:
Dynamic sample budget allocation in model-based optimization. 575-596 - Huseyin Onur Mete, Yanfang Shen, Zelda B. Zabinsky, Seksan Kiatsupaibul, Robert L. Smith:
Pattern discrete and mixed Hit-and-Run for global optimization. 597-627 - Jordan Ninin
A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms. 629-644 - Leocadio G. Casado
On determining the cover of a simplex by spheres centered at its vertices. 645-655 - Geng Lin, Wenxing Zhu, M. Montaz Ali
An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable. 657-673 - Xuebin Wang
A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation. 675-694 - Xiaojin Zheng, Xiaoling Sun, Duan Li
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations. 695-712 - Jein-Shan Chen
A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation. 713-728
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:32 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: