default search action
Journal of Global Optimization, Volume 73
Volume 73, Number 1, January 2019
- Peter Kirst
, Oliver Stein
Global optimization of generalized semi-infinite programs using disjunctive programming. 1-25 - Dajun Yue, Jiyao Gao, Bo Zeng, Fengqi You
A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs. 27-57 - Natasa Krejic, Natasa Krklec Jerinkic
Spectral projected gradient method for stochastic optimization. 59-81 - Minh N. Dao
A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting. 83-112 - Spencer D. Schaber
Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs. 113-151 - Xiaoni Chi
The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra. 153-169 - Victor Picheny, Mickaël Binois, Abderrahmane Habbal:
A Bayesian optimization approach to find Nash equilibria. 171-192 - Baohua Huang, Changfeng Ma
The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint. 193-221 - Vu Trung Hieu
Numbers of the connected components of the solution sets of monotone affine vector variational inequalities. 223-237
Volume 73, Number 2, February 2019
- Laura Palagi
Global optimization issues in deep network regression: an overview. 239-277 - Hoai An Le Thi
A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning. 279-310 - Yong Xia, Longfei Wang, Mei-Jia Yang:
A fast algorithm for globally solving Tikhonov regularized total least squares problem. 311-330 - Vando A. Adona, Max L. N. Gonçalves, Jefferson G. Melo:
Iteration-complexity analysis of a generalized alternating direction method of multipliers. 331-348 - Huu-Quang Nguyen, Ruey-Lin Sheu
Geometric properties for level sets of quadratic functions. 349-369 - Cheng Lu, Zhibin Deng
A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming. 371-388 - Adriano Zanin Zambom
Robot path planning in a dynamic environment with stochastic measurements. 389-410 - Renli Liang, Yanqin Bai, Hai-Xiang Lin
An inexact splitting method for the subspace segmentation from incomplete and noisy observations. 411-429 - Ryuta Tamura, Ken Kobayashi
Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor. 431-446 - Meenakshi Gupta
Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior. 447-463 - Alexander Mitsos
Correction to: Optimal deterministic algorithm generation. 465
Volume 73, Number 3, March 2019
- Dimitrios Nerantzis, Claire S. Adjiman
Tighter α BB relaxations through a refinement scheme for the scaled Gerschgorin theorem. 467-483 - Christoph Buchheim, Maribel Montenegro, Angelika Wiegele
SDP-based branch-and-bound for non-convex quadratic integer optimization. 485-514 - Bertrand Neveu, Martin de La Gorce, Pascal Monasse, Gilles Trombettoni
A generic interval branch and bound algorithm for parameter estimation. 515-535 - Orizon Pereira Ferreira
On the spherical convexity of quadratic functions. 537-545 - Tiago Montanher
Rigorous packing of unit squares into a circle. 547-565 - Michel H. Geoffroy
A topological convergence on power sets well-suited for set optimization. 567-581 - Julien Pelamatti, Loïc Brevault, Mathieu Balesdent, El-Ghazali Talbi, Yannick Guerin:
Efficient global optimization of constrained mixed variable problems. 583-613 - Diariétou Sambakhé
Conditional optimization of a noisy function using a kriging metamodel. 615-636 - Pham Ky Anh, Trinh Ngoc Hai:
Novel self-adaptive algorithms for non-Lipschitz equilibrium problems with applications. 637-657 - Abdullah Al-Dujaili, Suresh Sundaram:
Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis. 659-673 - John R. Birge:
Book Review: Xinbao Liu, Jun Pei, Lin Liu, Hao Cheng, Mi Zhou, and Panos M. Pardalos: Optimization and management in manufacturing engineering. Resource collaborative optimization and management through the Internet of Things. Springer optimization and its applications series - Springer, 2017, XVIII pp, Hardcover: ISBN: 978-3-319-64567-4. 675-676
Volume 73, Number 4, April 2019
- Alper Atamtürk
Lifted polymatroid inequalities for mean-risk optimization with indicator variables. 677-699 - Tiago Andrade, Fabricio Oliveira
Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming. 701-722 - Josef Kallrath, Markus M. Frey
Packing circles into perimeter-minimizing convex hulls. 723-759 - Aleksandr Yu. Chirkov, Dmitry V. Gribanov, Dmitriy S. Malyshev
On the complexity of quasiconvex integer minimization problem. 761-788 - Shouqiang Du, Liping Zhang:
A mixed integer programming approach to the tensor complementarity problem. 789-800 - Qiao-Li Dong
MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications. 801-824 - Nimit Nimana
Generalized forward-backward splitting with penalization for monotone inclusion problems. 825-847 - Le Hai Yen
A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models. 849-868 - Ying Gao, Xin-Min Yang:
Properties of the nonlinear scalar functional and its applications to vector optimization problems. 869-889 - Bennet Gebken
On the hierarchical structure of Pareto critical sets. 891-913
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-20 20:48 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: