default search action
Journal of Global Optimization, Volume 62
Volume 62, Number 1, May 2015
- Ana Luísa Custódio, J. F. Aguilar Madeira
:
GLODS: Global and Local Optimization using Direct Search. 1-28 - Da Lu, Fatma Gzara:
The robust crew pairing problem: model and solution methodology. 29-54 - Murat Köksalan, Banu Lokman
Finding nadir points in multi-objective integer programs. 55-77 - Gokhan Kirlik
Computing the nadir point for multiobjective discrete optimization problems. 79-99 - Ana Belen Ruiz
A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm. 101-129 - Chao Yang, Mrinal Kumar
An information guided framework for simulated annealing. 131-154 - Nergiz Kasimbeyli:
Existence and characterization theorems in nonconvex vector optimization. 155-165 - Tahar Haddad
Reduction of state dependent sweeping process to unconstrained differential inclusion. 167-182 - Giancarlo Bigi
D-gap functions and descent techniques for solving equilibrium problems. 183-203
Volume 62, Number 2, June 2015
- Qunfeng Liu
MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems. 205-227 - Ralph Baker Kearfott:
Some observations on exclusion regions in branch and bound algorithms. 229-241 - Markus E. Hartikainen, Alberto Lovison
PAINT-SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization. 243-261 - Yu-Ching Lee
An algorithm for global solution to bi-parametric linear complementarity constrained linear programs. 263-297 - Alberto Seeger, David Sossa:
Complementarity problems with respect to Loewnerian cones. 299-318 - Fabien Lauer, Henrik Ohlsson:
Finding sparse solutions of systems of polynomial equations via group-sparsity optimization. 319-349 - Selin Damla Ahipasaoglu
Fast algorithms for the minimum volume estimator. 351-370 - Jack Brimberg, Robert Schieweck, Anita Schöbel:
Locating a median line with partial coverage distance. 371-389 - K. G. Sirinanda, Marcus Brazil
Maximizing the net present value of a Steiner tree. 391-407 - Christos Koulamas, S. S. Panwalkar:
A note on the complexity of scheduling problems with linear job deterioration. 409-410
Volume 62, Number 3, July 2015
- Jean-Paul Penot:
Projective dualities for quasiconvex problems. 411-430 - Satoshi Suzuki, Daishi Kuroiwa:
Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential. 431-441 - Sándor Zoltán Németh
Extended Lorentz cones and mixed complementarity problems. 443-457 - Jinchuan Zhou, Jein-Shan Chen:
On the existence of saddle points for nonlinear second-order cone programming problems. 459-480 - Henri Bonnel, Julien Collonge:
Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case. 481-505 - Alan J. Chang, Marcus Brazil
Optimal curvature and gradient-constrained directional cost paths in 3-space. 507-527 - Konrad Kulakowski
Heuristic rating estimation: geometric approach. 529-543 - Da Kuang, Sangwoon Yun, Haesun Park:
SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering. 545-574 - Mario Eduardo Villanueva
Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs. 575-613
Volume 62, Number 4, August 2015
- Kok Lay Teo, Soon-Yi Wu, Naihua Xiu:
Special issue on "optimization and optimal control with applications" for the 9th international conference on optimization: techniques and applications (9th ICOTA), December 12-16, 2013, Taipei, Taiwan. 615 - Zhi-You Wu, J. Tian, Julien Ugon
Global optimality conditions and optimization methods for polynomial programming problems. 617-641 - Yanjun Wang, Ruizhi Shi, Jianming Shi
Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment. 643-659 - Chunli Liu, Jianjun Gao:
A polynomial case of convex integer quadratic programming problems with box integer constraints. 661-674 - Mengwei Xu, Jane J. Ye
Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems. 675-694 - Xueyong Wang, Shengjie Li, Xipeng Kou, Qifeng Zhang:
A new alternating direction method for linearly constrained nonconvex optimization problems. 695-709 - Zheng Peng, Jianli Chen, Wenxing Zhu:
A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints. 711-728 - Boshi Tian, Yaohua Hu, Xiaoqi Yang
A box-constrained differentiable penalty method for nonlinear complementarity problems. 729-747 - Boshi Tian, Yaohua Hu, Xiaoqi Yang
Erratum to: A box-constrained differentiable penalty method for nonlinear complementarity problems. 749 - Yunhai Xiao
Norm descent conjugate gradient methods for solving symmetric nonlinear equations. 751-762 - Xian-Jun Long, Jian-Wen Peng, Zai-Yun Peng:
Scalarization and pointwise well-posedness for set optimization problems. 763-773 - Song Wang:
A penalty approach to a discretized double obstacle problem with derivative constraints. 775-790 - Jinlong Yuan, Lei Wang
Parameter identification for a nonlinear enzyme-catalytic dynamic system with time-delays. 791-810 - Bilian Chen, Zhening Li
On optimal low rank Tucker approximation for tensors: the case for an adjustable core size. 811-832 - Fei Hu, Cheng-Chew Lim
The retailer's optimal decision on order quantity and credit periods under two-level trade credit policy. 833-852 - Jinming Duan
Fast algorithm for color texture image inpainting using the non-local CTV model. 853-876 - Bin Li, Hai Huyen Dam, Antonio Cantoni, Kok Lay Teo:
Some interesting properties for zero-forcing beamforming under per-antenna power constraints in rural areas. 877-886
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-12-19 22:02 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: