default search action
Journal of Global Optimization, Volume 76
Volume 76, Number 1, January 2020
- Marco Locatelli
:
Convex envelope of bivariate cubic functions over rectangular regions. 1-24 - Maxim V. Dolgopolik
New global optimality conditions for nonsmooth DC optimization problems. 25-55 - Majid E. Abbasov
Optimality conditions for an exhausterable function on an exhausterable set. 57-67 - Mickaël Binois
On the choice of the low-dimensional domain for global optimization via random embeddings. 69-90 - Orhan Arikan
Steklov regularization and trajectory methods for univariate global optimization. 91-120 - Van-Bong Nguyen
Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere. 121-135 - Lei Wu
A residual-based algorithm for solving a class of structured nonsmooth optimization problems. 137-153 - Yue Lu
The decompositions with respect to two core non-symmetric cones. 155-188 - Nguyen Thai An, Nguyen Mau Nam, Xiaolong Qin
Solving k-center problems involving sets based on optimization techniques. 189-209 - Zsolt Tibor Kosztyán
Multimode resource-constrained project scheduling in flexible projects. 211-241
Volume 76, Number 2, February 2020
- Michalis Doumpos, Constantin Zopounidis:
Multi-objective optimization models in finance and investments. 243-244 - Francesco Cesarone
An optimization-diversification approach to portfolio selection. 245-265 - Sandra Caçador
Global minimum variance portfolios under uncertainty: a robust optimization approach. 267-293 - Ana Belen Ruiz
Preference-based evolutionary multi-objective optimization for portfolio selection: a new credibilistic model under investor preferences. 295-315 - Florian Methling
Tailor-made thematic portfolios: a core satellite optimization. 317-331 - Francisco Salas-Molina
A stochastic goal programming model to derive stable cash management policies. 333-346 - Jen-Yen Lin
The joint replenishment problem with trade credits. 347-382 - João Gouveia
Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices. 383-405 - Javad Koushki
Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization. 407-431 - Biao Qu, Changyu Wang, Fanwen Meng:
Convergence analysis of a projection algorithm for variational inequality problems. 433-452
Volume 76, Number 3, March 2020
- Alexander V. Kononov, Alexander S. Strekalovsky, Mikhail Posypkin, Artem V. Pyatkin:
Preface. 453-454 - Anna N. Rettieva
Cooperation in dynamic multicriteria games with random horizons. 455-470 - Akiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich
Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost. 471-490 - Alexander A. Ageev
Approximating the 2-machine flow shop problem with exact delays taking two values. 491-497 - Alexander Vasin, Olesya Grigoryeva
A model for optimization of transport infrastructure for some homogeneous goods markets. 499-518 - Stephan Dempe
A special three-level optimization problem. 519-531 - Alexander Yu. Gornov, Tatiana S. Zarodnyuk
Extension technology and extrema selections in a stochastic multistart algorithm for optimal control problems. 533-543 - Zeynep Ertem, Eugene Lykhovyd, Yiming Wang, Sergiy Butenko
The maximum independent union of cliques problem: complexity and exact approaches. 545-562 - Alexander P. Afanasiev, Vladimir E. Krivonozhko
Multidimensional frontier visualization based on optimization methods using parallel computations. 563-574 - Aladin Crnkic
Consensus and balancing on the three-sphere. 575-586 - Maxim V. Staritsyn
On feedback strengthening of the maximum principle for measure differential equations. 587-612 - Boris T. Polyak, Andrey A. Tremba
Sparse solutions of optimal control via Newton method for under-determined systems. 613-623 - Olga N. Samsonyuk
Optimality conditions for optimal impulsive control problems with multipoint state constraints. 625-644 - Michael Dreyfuss, Irit Nowik
A puzzled driver is a better driver: enforcing speed limits using a randomization strategy. 645-660
Volume 76, Number 4, April 2020
- Ya-Feng Liu, Fengmin Xu, Neng Fan, Jiming Peng:
Preface: special issue of MOA 2018. 661-663 - Kai Tu
A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems. 665-693 - Min Li, Dachuan Xu
The seeding algorithms for spherical k-means clustering. 695-708 - Fengzhen Zhai, Qingna Li
A Euclidean distance matrix model for protein molecular conformation. 709-728 - Yijing Wang, Dachuan Xu
Non-submodular maximization on massive data streams. 729-743 - Qian Liu, Yuqing Xu, Yang Zhou
A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems. 745-768 - Wanyou Cheng
An active set Barzilar-Borwein algorithm for l0 regularized optimization. 769-791 - Jianlin Jiang, Su Zhang
An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge. 793-818 - Fan Wu, Wei Bian
Accelerated iterative hard thresholding algorithm for l0 regularized regression problem. 819-840 - Min Xi, Wenyu Sun
A derivative-free algorithm for spherically constrained optimization. 841-861 - Xue Gao, Xingju Cai, Deren Han:
A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems. 863-887 - Minru Bai, Jing Zhao, Zhanghui Zhang:
A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors. 889-911 - Florian Jarre
Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting. 913-932
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-15 01:16 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: