Printed from https://ideas.repec.org/s/spr/jglopt5.html
Content
July 2018, Volume 71, Issue 3
- 517-536 Filter-based DIRECT method for constrained global optimization
by M. Fernanda P. Costa & Ana Maria A. C. Rocha & Edite M. G. P. Fernandes - 537-550 Metabolic pathway analysis using a nash equilibrium approach
by Angelo Lucia & Peter A. DiMaggio & Diego Alonso-Martinez - 551-569 Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
by Immanuel M. Bomze & Vaithilingam Jeyakumar & Guoyin Li - 571-592 Reformulations for utilizing separability when solving convex MINLP problems
by Jan Kronqvist & Andreas Lundell & Tapio Westerlund - 593-612 Integrality gap minimization heuristics for binary mixed integer nonlinear programming
by Wendel Melo & Marcia Fampa & Fernanda Raupp - 613-630 A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
by Daniel Aloise & Claudio Contardo - 631-649 Improving the performance and energy of Non-Dominated Sorting for evolutionary multiobjective optimization on GPU/CPU platforms
by J. J. Moreno & G. Ortega & E. Filatovas & J. A. Martínez & E. M. Garzón
June 2018, Volume 71, Issue 2
- 237-296 Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
by M. V. Dolgopolik - 297-311 A modified simplicial algorithm for convex maximization based on an extension of $$\omega $$ ω -subdivision
by Takahito Kuno - 313-339 Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
by Shinji Yamada & Akiko Takeda - 341-360 “Optimal” choice of the step length of the projection and contraction methods for solving the split feasibility problem
by Q. L. Dong & Y. C. Tang & Y. J. Cho & Th. M. Rassias - 361-381 Nash game based efficient global optimization for large-scale design problems
by Shengguan Xu & Hongquan Chen - 383-405 Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure
by Shokouh Shahbeyk & Majid Soleimani-damaneh & Refail Kasimbeyli - 407-438 Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm
by Eric Bradford & Artur M. Schweidtmann & Alexei Lapkin - 439-440 Correction to: Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm
by Eric Bradford & Artur M. Schweidtmann & Alexei Lapkin
May 2018, Volume 71, Issue 1
- 1-4 Guest editors’ preface to the special issue devoted to the 2nd International Conference “Numerical Computations: Theory and Algorithms”, June 19–25, 2016, Pizzo Calabro, Italy
by Renato Leone & Yaroslav D. Sergeyev & Anatoly Zhigljavsky - 5-20 Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
by Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas - 21-36 Solving a set of global optimization problems by the parallel technique with uniform convergence
by Konstantin Barkalov & Roman Strongin - 37-55 Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
by Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico & Adil M. Bagirov - 57-71 Performance of global random search algorithms for large dimensions
by Andrey Pepelyshev & Anatoly Zhigljavsky & Antanas Žilinskas - 73-90 Efficient multicriterial optimization based on intensive reuse of search information
by Victor Gergel & Evgeny Kozinov - 91-113 On a class of bilevel linear mixed-integer programs in adversarial settings
by M. Hosein Zare & Osman Y. Özaltın & Oleg A. Prokopyev - 115-127 An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
by Albertas Gimbutas & Antanas Žilinskas - 129-145 Approximating a solution set of nonlinear inequalities
by Yuri Evtushenko & Mikhail Posypkin & Larisa Rybak & Andrei Turkin - 147-163 Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
by Wenjuan Fan & Jun Pei & Xinbao Liu & Panos M. Pardalos & Min Kong - 165-191 On convergence rate of a rectangular partition based global optimization algorithm
by James Calvin & Gražina Gimbutienė & William O. Phillips & Antanas Žilinskas - 193-211 GOSH: derivative-free global optimization using multi-dimensional space-filling curves
by Daniela Lera & Yaroslav D. Sergeyev - 213-235 Bayesian optimization of pump operations in water distribution systems
by A. Candelieri & R. Perego & F. Archetti
April 2018, Volume 70, Issue 4
- 707-718 How to project onto extended second order cones
by O. P. Ferreira & S. Z. Németh - 719-735 Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
by Xiaojin Zheng & Yutong Pan & Xueting Cui - 737-756 An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
by Yinrun Lyu & Li Chen & Changyou Zhang & Dacheng Qu & Nasro Min-Allah & Yongji Wang - 757-781 An adaptive framework for costly black-box global optimization based on radial basis function interpolation
by Zhe Zhou & Fusheng Bai - 783-809 Simulation optimization of risk measures with adaptive risk levels
by Helin Zhu & Joshua Hale & Enlu Zhou - 811-842 A Utility Theory Based Interactive Approach to Robustness in Linear Optimization
by Mehdi Karimi & Somayeh Moazeni & Levent Tunçel - 843-858 Tensor maximal correlation problems
by Anwa Zhou & Xin Zhao & Jinyan Fan & Yanqin Bai - 859-873 Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain
by Qiaoming Han & Donglei Du & Dachuan Xu & Yicheng Xu - 875-901 Approximate solutions of vector optimization problems via improvement sets in real linear spaces
by C. Gutiérrez & L. Huerga & B. Jiménez & V. Novo - 903-916 Scalarizations for a unified vector optimization problem based on order representing and order preserving properties
by Khushboo & C. S. Lalitha
March 2018, Volume 70, Issue 3
- 497-516 An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
by Kai Zhou & Mustafa R. Kılınç & Xi Chen & Nikolaos V. Sahinidis - 517-549 A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
by Jian Lv & Li-Ping Pang & Fan-Yun Meng - 551-577 Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
by Xiaolong Kuang & Luis F. Zuluaga - 579-599 An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
by Yiduo Zhan & Qipeng P. Zheng & Chung-Li Tseng & Eduardo L. Pasiliao - 601-623 A trajectory-based method for mixed integer nonlinear programming problems
by Terry-Leigh Oliphant & M. Montaz Ali - 625-644 A Frank–Wolfe based branch-and-bound algorithm for mean-risk optimization
by Christoph Buchheim & Marianna De Santis & Francesco Rinaldi & Long Trieu - 645-675 Order-based error for managing ensembles of surrogates in mesh adaptive direct search
by Charles Audet & Michael Kokkolaras & Sébastien Le Digabel & Bastien Talgorn - 677-685 Partial inverse maximum spanning tree in which weight can only be decreased under $$l_p$$ l p -norm
by Xianyue Li & Zhao Zhang & Ding-Zhu Du - 687-704 Inertial projection and contraction algorithms for variational inequalities
by Q. L. Dong & Y. J. Cho & L. L. Zhong & Th. M. Rassias - 705-706 Corrections to: Differentiable McCormick relaxations
by Kamil A. Khan & Matthew Wilhelm & Matthew D. Stuber & Huiyi Cao & Harry A. J. Watson & Paul I. Barton
February 2018, Volume 70, Issue 2
- 307-307 Preface
by Sebastiano Battiato & Patrizia Daniele & Giovanni Maria Farinella & Sofia Giuffrè & Laura Rosa Maria Scrimali - 309-327 New necessary and sufficient optimality conditions for strong bilevel programming problems
by Abdelmalek Aboussoror & Samir Adly - 329-346 On an equilibrium problem with complementarity constraints formulation of pay-as-clear electricity market with demand elasticity
by Elisabetta Allevi & Didier Aussel & Rossana Riccardi - 347-384 Evaluating the impacts of the external supply risk in a natural gas supply chain: the case of the Italian market
by E. Allevi & L. Boffino & M. E. Giuli & G. Oggioni - 385-399 New extragradient-like algorithms for strongly pseudomonotone variational inequalities
by Dang Hieu & Duong Viet Thong - 401-411 Inverse problems for quasi-variational inequalities
by Akhtar A. Khan & Dumitru Motreanu - 413-436 Security investment and information sharing in the market of complementary firms: impact of complementarity degree and industry size
by Xinbao Liu & Xiaofei Qian & Jun Pei & Panos M. Pardalos - 437-453 Second-order necessary efficiency conditions for nonsmooth vector equilibrium problems
by Do Van Luu - 455-476 Cooperation in pollution control problems via evolutionary variational inequalities
by Laura Scrimali & Cristina Mirabella - 477-495 The Glowinski–Le Tallec splitting method revisited in the framework of equilibrium problems in Hilbert spaces
by Phan Tu Vuong & Jean Jacques Strodiot
January 2018, Volume 70, Issue 1
- 1-3 Preface: Special issue of MOA 2016
by Thorsten Koch & Ya-Feng Liu & Jiming Peng - 5-25 A sparse enhanced indexation model with chance and cardinality constraints
by Fengmin Xu & Meihua Wang & Yu-Hong Dai & Dachuan Xu - 27-53 Optimal replenishment and stocking strategies for inventory mechanism with a dynamically stochastic short-term price discount
by Yiju Wang & Hengxia Gao & Wei Xing - 55-69 On the stability of solutions for semi-infinite vector optimization problems
by Zai-Yun Peng & Jian-Wen Peng & Xian-Jun Long & Jen-Chih Yao - 71-97 Two-stage convex relaxation approach to low-rank and sparsity regularized least squares loss
by Le Han & Shujun Bi - 99-130 Approximation algorithms for optimization of real-valued general conjugate complex forms
by Taoran Fu & Bo Jiang & Zhening Li - 131-158 Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems
by Xiaojiao Tong & Hailin Sun & Xiao Luo & Quanguo Zheng - 159-170 Optimality analysis on partial $$l_1$$ l 1 -minimization recovery
by Huan Gao & Haibin Zhang & Zhibao Li & Kai Tu - 171-187 Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
by Cheng Lu & Zhibin Deng & Wei-Qiang Zhang & Shu-Cherng Fang - 189-206 A computational study of primal heuristics inside an MI(NL)P solver
by Timo Berthold - 207-222 Approximation algorithms for the robust/soft-capacitated 2-level facility location problems
by Chenchen Wu & Dachuan Xu & Dongmei Zhang & Peng Zhang - 223-236 Smoothing partial exact penalty splitting method for mathematical programs with equilibrium constraints
by Suhong Jiang & Jin Zhang & Caihua Chen & Guihua Lin - 237-259 A quadratic penalty method for hypergraph matching
by Chunfeng Cui & Qingna Li & Liqun Qi & Hong Yan - 261-288 Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
by Davood Hajinezhad & Qingjiang Shi - 289-306 Generalized coefficient strengthening cuts for mixed integer programming
by Wei-Kun Chen & Liang Chen & Mu-Ming Yang & Yu-Hong Dai
December 2017, Volume 69, Issue 4
- 761-796 Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
by Dominik Bongartz & Alexander Mitsos - 797-822 Adaptive block coordinate DIRECT algorithm
by Qinghua Tao & Xiaolin Huang & Shuning Wang & Li Li - 823-845 Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap
by Fabián Flores-Bazán & William Echegaray & Fernando Flores-Bazán & Eladio Ocaña - 847-868 Posterior exploration based sequential Monte Carlo for global optimization
by Bin Liu - 869-888 On the convergence rate issues of general Markov search for global minimum
by Dawid Tarłowski - 889-909 A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
by D. Russell Luke & Shoham Sabach & Marc Teboulle & Kobi Zatlawey - 911-925 Inverse max $$+$$ + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
by Xiucui Guan & Xinyan He & Panos M. Pardalos & Binwu Zhang - 927-949 Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
by Pooriya Beyhaghi & Thomas Bewley - 951-965 On some geometric conditions for minimality of DCH-functions via DC-duality approach
by Mahide Küçük & Didem Tozkan & Yalçın Küçük
November 2017, Volume 69, Issue 3
- 525-545 Recent advances on the interval distance geometry problem
by Douglas S. Gonçalves & Antonio Mucherino & Carlile Lavor & Leo Liberti - 547-560 On parallel Branch and Bound frameworks for Global Optimization
by Juan F. R. Herrera & José M. G. Salmerón & Eligius M. T. Hendrix & Rafael Asenjo & Leocadio G. Casado - 561-585 On a smoothed penalty-based algorithm for global optimization
by Ana Maria A. C. Rocha & M. Fernanda P. Costa & Edite M. G. P. Fernandes - 587-606 On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
by Richard Oberdieck & Nikolaos A. Diangelakis & Styliani Avraamidou & Efstratios N. Pistikopoulos - 607-627 Non-dominated sorting procedure for Pareto dominance ranking on multicore CPU and/or GPU
by G. Ortega & E. Filatovas & E. M. Garzón & L. G. Casado - 629-676 The cluster problem in constrained global optimization
by Rohit Kannan & Paul I. Barton - 677-697 Virtuous smoothing for global optimization
by Jon Lee & Daphne Skipper - 699-712 On nadir points of multiobjective integer programming problems
by Özgür Özpeynirci - 713-725 Knapsack with variable weights satisfying linear constraints
by Kameng Nip & Zhenbo Wang & Zizhuo Wang - 727-744 A mixed integer programming-based global optimization framework for analyzing gene expression data
by Giovanni Felici & Kumar Parijat Tripathi & Daniela Evangelista & Mario Rosario Guarracino - 745-760 Global optimization for optimal power flow over transmission networks
by Y. Shi & H. D. Tuan & H. Tuy & S. Su
October 2017, Volume 69, Issue 2
- 283-307 Global optimization of disjunctive programs
by Peter Kirst & Fabian Rigterink & Oliver Stein - 309-342 A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
by Amir Beck & Dror Pan - 343-367 An exact algorithm for the minimum dilation triangulation problem
by Sattar Sattari & Mohammad Izadi - 369-385 Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
by Andreas Löhne & Andrea Wagner - 387-426 Dual method of centers for solving generalized fractional programs
by K. Boufi & A. Roubi - 427-442 A theorem of the alternative with an arbitrary number of inequalities and quadratic programming
by M. Ruiz Galán - 443-459 Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
by Ville-Pekka Eronen & Jan Kronqvist & Tapio Westerlund & Marko M. Mäkelä & Napsu Karmitsa - 461-484 A certified Branch & Bound approach for reliability-based optimization problems
by Benjamin Martin & Marco Correia & Jorge Cruz - 485-510 Decision uncertainty in multiobjective optimization
by Gabriele Eichfelder & Corinna Krüger & Anita Schöbel - 511-523 Optimality condition and complexity of order-value optimization problems and low order-value optimization problems
by Zhongyi Jiang & Qiying Hu & Xiaojin Zheng
September 2017, Volume 69, Issue 1
- 1-21 Parallel distributed block coordinate descent methods based on pairwise comparison oracle
by Kota Matsui & Wataru Kumagai & Takafumi Kanamori - 23-44 Geodesic and contour optimization using conformal mapping
by Ricky Fok & Aijun An & Xiaogong Wang - 45-67 iGreen: green scheduling for peak demand minimization
by Shaojie Tang & Jing Yuan & Zhao Zhang & Ding-zhu Du - 69-102 Solving linear optimization over arithmetic constraint formula
by Li Chen & Yinrun Lyu & Chong Wang & Jingzheng Wu & Changyou Zhang & Nasro Min-Allah & Jamal Alhiyafi & Yongji Wang - 103-115 Incorporation of delivery times in stereotactic radiosurgery treatment optimization
by Hamid R. Ghaffari & Dionne M. Aleman & David A. Jaffray & Mark Ruschin - 117-136 GOSAC: global optimization with surrogate approximation of constraints
by Juliane Müller & Joshua D. Woodbury - 137-156 A Lagrangian search method for the P-median problem
by Joshua Q. Hale & Enlu Zhou & Jiming Peng - 157-182 Certificates of infeasibility via nonsmooth optimization
by Hannes Fendl & Arnold Neumaier & Hermann Schichl - 183-230 Strong valid inequalities for Boolean logical pattern generation
by Kedong Yan & Hong Seo Ryoo - 231-254 Supply chain network capacity competition with outsourcing: a variational equilibrium framework
by Anna Nagurney & Min Yu & Deniz Besik - 255-282 Fractional 0–1 programming: applications and algorithms
by Juan S. Borrero & Colin Gillen & Oleg A. Prokopyev
August 2017, Volume 68, Issue 4
- 685-711 Guided dive for the spatial branch-and-bound
by D. Gerard & M. Köppe & Q. Louveaux - 713-727 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
by Rudolf Scitovski - 729-747 Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers
by Abay Molla Kassa & Semu Mitiku Kassa - 749-775 A new fully polynomial time approximation scheme for the interval subset sum problem
by Rui Diao & Ya-Feng Liu & Yu-Hong Dai - 777-798 DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling
by Rundong Du & Da Kuang & Barry Drake & Haesun Park - 799-814 Parallel machine scheduling with general sum of processing time based models
by Radosław Rudek - 815-826 Global convergence of proximal iteratively reweighted algorithm
by Tao Sun & Hao Jiang & Lizhi Cheng - 827-849 Kriging surrogate model with coordinate transformation based on likelihood and gradient
by Nobuo Namura & Koji Shimoyama & Shigeru Obayashi - 851-878 A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning
by Chang Fang & Xinbao Liu & Panos M. Pardalos & Jianyu Long & Jun Pei & Chao Zuo - 879-898 Global probability maximization for a Gaussian bilateral inequality in polynomial time
by Michel Minoux & Riadh Zorgati - 899-923 Vectorial penalization for generalized functional constrained problems
by Marius Durea & Radu Strugariu
July 2017, Volume 68, Issue 3
- 467-499 A nonlinear programming model with implicit variables for packing ellipsoids
by E. G. Birgin & R. D. Lobato & J. M. Martínez - 501-535 A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
by Kaisa Joki & Adil M. Bagirov & Napsu Karmitsa & Marko M. Mäkelä - 537-562 An approximate bundle method for solving nonsmooth equilibrium problems
by Fan-Yun Meng & Li-Ping Pang & Jian Lv & Jin-He Wang - 563-586 Global optimization of non-convex piecewise linear regression splines
by Nadia Martinez & Hadis Anahideh & Jay M. Rosenberger & Diana Martinez & Victoria C. P. Chen & Bo Ping Wang - 587-600 Coradiant sets and $$\varepsilon $$ ε -efficiency in multiobjective optimization
by Abbas Sayadi-bander & Latif Pourkarimi & Refail Kasimbeyli & Hadi Basirzadeh - 601-622 The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
by Marcel Turkensteen & Dmitry Malyshev & Boris Goldengorin & Panos M. Pardalos - 623-640 Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems
by Hongtan Sun & Thomas C. Sharkey - 641-662 Pseudo expected improvement criterion for parallel EGO algorithm
by Dawei Zhan & Jiachang Qian & Yuansheng Cheng - 663-675 Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization
by Christopher M. Cotnoir & Balša Terzić - 677-683 A review of computation of mathematically rigorous bounds on optima of linear programs
by Jared T. Guilbeau & Md. Istiaq Hossain & Sam D. Karhbet & Ralph Baker Kearfott & Temitope S. Sanusi & Lihong Zhao
June 2017, Volume 68, Issue 2
- 227-253 A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
by Hatim Djelassi & Alexander Mitsos - 255-277 Solving discrete linear bilevel optimization problems using the optimal value reformulation
by S. Dempe & F. Mefo Kue - 279-306 Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach
by Alberto Seeger & José Vidal -Nuñez - 307-328 Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization
by Duy Khuong Nguyen & Tu Bao Ho - 329-355 Matrix product constraints by projection methods
by Veit Elser - 357-366 Self-concordance is NP-hard
by Lek-Heng Lim - 367-385 Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
by J. M. Martínez & M. Raydan - 387-411 Kantorovich’s theorem on Newton’s method under majorant condition in Riemannian manifolds
by T. Bittencourt & O. P. Ferreira - 413-438 Chebyshev model arithmetic for factorable functions
by Jai Rajyaguru & Mario E. Villanueva & Boris Houska & Benoît Chachuat - 439-461 Equal Risk Bounding is better than Risk Parity for portfolio selection
by Francesco Cesarone & Fabio Tardella - 463-466 Erratum to: An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
by Amadeu Almeida Coco & João Carlos Abreu Júnior & Thiago F. Noronha & Andréa Cynthia Santos
May 2017, Volume 68, Issue 1
- 1-22 A branch and bound algorithm for quantified quadratic programming
by F. Domes & A. Goldsztejn - 23-45 Algorithms for art gallery illumination
by Maximilian Ernestus & Stephan Friedrichs & Michael Hemmer & Jan Kokemüller & Alexander Kröller & Mahdi Moeini & Christiane Schmidt - 47-69 A recursive algorithm for multivariate risk measures and a set-valued Bellman’s principle
by Zachary Feinstein & Birgit Rudloff - 71-93 An approach to generate comprehensive piecewise linear interpolation of pareto outcomes to aid decision making
by Kalyan Shankar Bhattacharjee & Hemant Kumar Singh & Tapabrata Ray - 95-123 Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
by Hao-Chun Lu - 125-146 Global saddle points of nonlinear augmented Lagrangian functions
by Changyu Wang & Qian Liu & Biao Qu - 147-167 Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing
by Liangyu Chen & Yaochen Xu & Zhenbing Zeng - 169-187 Application of the sequential parametric convex approximation method to the design of robust trusses
by Alfredo Canelas & Miguel Carrasco & Julio López - 189-217 Improving simulated annealing through derandomization
by Mathieu Gerber & Luke Bornn - 219-225 Erratum to: Multivariate McCormick relaxations
by Jaromił Najman & Dominik Bongartz & Angelos Tsoukalas & Alexander Mitsos
April 2017, Volume 67, Issue 4
- 687-729 Differentiable McCormick relaxations
by Kamil A. Khan & Harry A. J. Watson & Paul I. Barton - 731-757 Three enhancements for optimization-based bound tightening
by Ambros M. Gleixner & Timo Berthold & Benjamin Müller & Stefan Weltge - 759-786 Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
by Christoph Buchheim & Claudia D’Ambrosio - 787-804 On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem
by José L. Sainz-Pardo & Javier Alcaraz & Mercedes Landete & Juan F. Monge - 805-827 Robust optimization approximation for joint chance constrained optimization problem
by Yuan Yuan & Zukui Li & Biao Huang - 829-850 Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints
by Nooshin Movahedian - 851-872 Improving the convergence rate of the DIRECT global optimization algorithm
by Qunfeng Liu & Guang Yang & Zhongzhi Zhang & Jinping Zeng - 873-892 Balancing global and local search in parallel efficient global optimization algorithms
by Dawei Zhan & Jiachang Qian & Yuansheng Cheng - 893-907 Default policies for global optimisation of noisy functions with severe noise
by Spyridon Samothrakis & Maria Fasli & Diego Perez & Simon Lucas - 909-924 Universal rigidity of bar frameworks via the geometry of spectrahedra
by A. Y. Alfakih
March 2017, Volume 67, Issue 3
- 451-474 Enclosure of all index-1 saddle points of general nonlinear functions
by Dimitrios Nerantzis & Claire S. Adjiman - 475-493 An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
by Cheng Lu & Zhibin Deng & Qingwei Jin - 495-525 Analysis of budget for interdiction on multicommodity network flows
by Pengfei Zhang & Neng Fan - 527-551 Multiple depot ring star problem: a polyhedral study and an exact algorithm
by Kaarthik Sundar & Sivakumar Rathinam - 553-579 Branch and bound algorithm with applications to robust stability
by Laleh Ravanbod & Dominikus Noll & Pierre Apkarian - 581-600 A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions
by Tobias Kuhn & Stefan Ruzika - 601-619 Covers and approximations in multiobjective optimization
by Daniel Vanderpooten & Lakmali Weerasena & Margaret M. Wiecek - 621-630 A polynomially solvable case of the pooling problem
by Natashia Boland & Thomas Kalinowski & Fabian Rigterink - 631-669 Relaxations and discretizations for the pooling problem
by Akshay Gupte & Shabbir Ahmed & Santanu S. Dey & Myun Seok Cheon - 671-686 Heuristic solution approaches for the maximum minsum dispersion problem
by Anna Martínez-Gavara & Vicente Campos & Manuel Laguna & Rafael Martí
January 2017, Volume 67, Issue 1
- 1-1 Preface
by Panos M. Pardalos - 3-42 Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption
by Fani Boukouvala & M. M. Faruque Hasan & Christodoulos A. Floudas - 43-58 Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
by Juan P. Ruiz & Ignacio E. Grossmann - 59-77 Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
by Yash Puranik & Nikolaos V. Sahinidis - 79-96 ParEGO extensions for multi-objective optimization of expensive evaluation functions
by Joan Davins-Valldaura & Saïd Moussaoui & Guillermo Pita-Gil & Franck Plestan - 97-133 A Bayesian approach to constrained single- and multi-objective optimization
by Paul Feliot & Julien Bect & Emmanuel Vazquez - 135-149 Interactive model-based search with reactive resource allocation
by Yue Sun & Alfredo Garcia - 151-185 Packing ellipsoids into volume-minimizing rectangular boxes
by Josef Kallrath - 187-205 On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
by Alla Kammerdiner & Alexander Veremyev & Eduardo Pasiliao - 207-221 Optimal transport and a bilevel location-allocation problem
by Lina Mallozzi & Antonia Passarelli di Napoli - 223-250 Supply chain performance assessment and supplier and component importance identification in a general competitive multitiered supply chain network model
by Dong Li & Anna Nagurney - 251-262 Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine
by Jun Pei & Xinbao Liu & Panos M. Pardalos & Athanasios Migdalas & Shanlin Yang - 263-282 Dynamic algorithm selection for pareto optimal set approximation
by Ingrida Steponavičė & Rob J. Hyndman & Kate Smith-Miles & Laura Villanova - 283-323 A diverse human learning optimization algorithm
by Ling Wang & Lu An & Jiaxing Pi & Minrui Fei & Panos M. Pardalos - 325-342 A modified active set algorithm for transportation discrete network design bi-level problem
by Ximing Wang & Panos M. Pardalos - 343-366 A Kriging-based constrained global optimization algorithm for expensive black-box functions with infeasible initial points
by Yaohui Li & Yizhong Wu & Jianjun Zhao & Liping Chen - 367-378 Local search algorithm for universal facility location problem with linear penalties
by Yicheng Xu & Dachuan Xu & Donglei Du & Chenchen Wu - 379-397 Some feasibility sampling procedures in interval methods for constrained global optimization
by Mengyi Ying & Min Sun - 399-423 An efficient multi-objective PSO algorithm assisted by Kriging metamodel for expensive black-box problems
by Haoxiang Jie & Yizhong Wu & Jianjun Zhao & Jianwan Ding & Liangliang - 425-450 Application of Reduced-set Pareto-Lipschitzian Optimization to truss optimization
by Jonas Mockus & Remigijus Paulavičius & Dainius Rusakevičius & Dmitrij Šešok & Julius Žilinskas
December 2016, Volume 66, Issue 4
- 595-596 Journal of Global Optimization Best Paper Award for 2015
by Sergiy Butenko - 597-628 Convergence analysis of multivariate McCormick relaxations
by Jaromił Najman & Alexander Mitsos