default search action
Journal of Global Optimization, Volume 68
Volume 68, Number 1, May 2017
- Ferenc Domes, Alexandre Goldsztejn
:
A branch and bound algorithm for quantified quadratic programming. 1-22 - Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini
Algorithms for art gallery illumination. 23-45 - Zachary Feinstein
A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle. 47-69 - Kalyan Shankar Bhattacharjee, Hemant Kumar Singh
An approach to generate comprehensive piecewise linear interpolation of pareto outcomes to aid decision making. 71-93 - Hao-Chun Lu:
Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms. 95-123 - Changyu Wang, Qian Liu, Biao Qu:
Global saddle points of nonlinear augmented Lagrangian functions. 125-146 - Liangyu Chen, Yaochen Xu, Zhenbing Zeng:
Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing. 147-167 - Alfredo Canelas
Application of the sequential parametric convex approximation method to the design of robust trusses. 169-187 - Mathieu Gerber
Improving simulated annealing through derandomization. 189-217 - Jaromil Najman, Dominik Bongartz
Erratum to: Multivariate McCormick relaxations. 219-225
Volume 68, Number 2, June 2017
- Hatim Djelassi, Alexander Mitsos
A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs. 227-253 - Stephan Dempe
Solving discrete linear bilevel optimization problems using the optimal value reformulation. 255-277 - Alberto Seeger, José Vidal-Núñez:
Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach. 279-306 - Duy Khuong Nguyen, Tu Bao Ho:
Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization. 307-328 - Veit Elser:
Matrix product constraints by projection methods. 329-355 - Lek-Heng Lim:
Self-concordance is NP-hard. 357-366 - José Mario Martínez
Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. 367-385 - Tiberio Bittencourt, Orizon Pereira Ferreira
Kantorovich's theorem on Newton's method under majorant condition in Riemannian manifolds. 387-411 - Jai Rajyaguru, Mario Eduardo Villanueva
Chebyshev model arithmetic for factorable functions. 413-438 - Francesco Cesarone
Equal Risk Bounding is better than Risk Parity for portfolio selection. 439-461 - Amadeu Almeida Coco
Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem. 463-466
Volume 68, Number 3, July 2017
- Ernesto G. Birgin
A nonlinear programming model with implicit variables for packing ellipsoids. 467-499 - Kaisa Joki
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes. 501-535 - Fan-Yun Meng, Li-Ping Pang, Jian Lv, Jin-He Wang:
An approximate bundle method for solving nonsmooth equilibrium problems. 537-562 - Nadia Martinez, Hadis Anahideh
Global optimization of non-convex piecewise linear regression splines. 563-586 - Abbas Sayadi-bander, Latif Pourkarimi
Coradiant sets and ε -efficiency in multiobjective optimization. 587-600 - Marcel Turkensteen, Dmitriy S. Malyshev
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems. 601-622 - Hongtan Sun
Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems. 623-640 - Dawei Zhan
Pseudo expected improvement criterion for parallel EGO algorithm. 641-662 - Christopher M. Cotnoir, Balsa Terzic
Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization. 663-675 - Jared T. Guilbeau, Md. Istiaq Hossain, Sam D. Karhbet, Ralph Baker Kearfott
A review of computation of mathematically rigorous bounds on optima of linear programs. 677-683
Volume 68, Number 4, August 2017
- Gérard Dedieu, Matthias Köppe, Quentin Louveaux:
Guided dive for the spatial branch-and-bound. 685-711 - Rudolf Scitovski:
A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set. 713-727 - Abay Molla Kassa, Semu Mitiku Kassa
Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers. 729-747 - Rui Diao, Ya-Feng Liu, Yu-Hong Dai:
A new fully polynomial time approximation scheme for the interval subset sum problem. 749-775 - Rundong Du, Da Kuang, Barry L. Drake, Haesun Park
DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling. 777-798 - Radoslaw Rudek
Parallel machine scheduling with general sum of processing time based models. 799-814 - Tao Sun, Hao Jiang, Lizhi Cheng:
Global convergence of proximal iteratively reweighted algorithm. 815-826 - Nobuo Namura
Kriging surrogate model with coordinate transformation based on likelihood and gradient. 827-849 - Chang Fang, Xinbao Liu, Panos M. Pardalos, Jianyu Long, Jun Pei, Chao Zuo
A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning. 851-878 - Michel Minoux, Riadh Zorgati:
Global probability maximization for a Gaussian bilateral inequality in polynomial time. 879-898 - Marius Durea
Vectorial penalization for generalized functional constrained problems. 899-923
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-15 19:20 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: