Content
January 2018, Volume 70, Issue 1
- 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 - 629-668 Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
by Marco Locatelli - 669-710 New multi-commodity flow formulations for the pooling problem
by Natashia Boland & Thomas Kalinowski & Fabian Rigterink - 711-727 Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem
by Seksan Kiatsupaibul & Robert L. Smith & Zelda B. Zabinsky - 729-768 MONEDA: scalable multi-objective optimization with a neural network-based estimation of distribution algorithm
by Luis Martí & Jesús García & Antonio Berlanga & José M. Molina - 769-790 Scatter search for the bandpass problem
by Jesús Sánchez-Oro & Manuel Laguna & Rafael Martí & Abraham Duarte - 791-810 Gap functions for quasi-equilibria
by Giancarlo Bigi & Mauro Passacantando - 811-845 MSO: a framework for bound-constrained black-box global optimization algorithms
by Abdullah Al-Dujaili & S. Suresh & N. Sundararajan
November 2016, Volume 66, Issue 3
- 331-382 Delaunay-based derivative-free optimization via global surrogates, part I: linear constraints
by Pooriya Beyhaghi & Daniele Cavaglieri & Thomas Bewley - 383-415 Delaunay-based derivative-free optimization via global surrogates, part II: convex constraints
by Pooriya Beyhaghi & Thomas R. Bewley - 417-437 SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems
by Tipaluck Krityakierne & Taimoor Akhtar & Christine A. Shoemaker - 439-456 Sufficient conditions for error bounds of difference functions and applications
by Nguyen Thi Hang & Jen-Chih Yao - 457-485 A block coordinate variable metric forward–backward algorithm
by Emilie Chouzenoux & Jean-Christophe Pesquet & Audrey Repetti - 487-510 Smoothing and SAA method for stochastic programming problems with non-smooth objective and constraints
by Gui-Hua Lin & Mei-Ju Luo & Jin Zhang - 511-534 Global versus local search: the impact of population sizes on evolutionary algorithm performance
by Thomas Weise & Yuezhong Wu & Raymond Chiong & Ke Tang & Jörg Lässig - 535-572 An optimal algorithm for Global Optimization and adaptive covering
by Serge L. Shishkin & Alan M. Finn - 573-583 A primal–dual prediction–correction algorithm for saddle point optimization
by Hongjin He & Jitamitra Desai & Kai Wang - 585-593 The Lyapunov rank of extended second order cones
by Roman Sznajder
October 2016, Volume 66, Issue 2
- 311-329 Convex hull characterizations of lexicographic orderings
by Warren Adams & Pietro Belotti & Ruobing Shen
September 2016, Volume 66, Issue 1
- 1-1 Special Issue: XVI Baikal International School-Seminar >
by Oleg Khamisov & Yury Kochetov & Alexander Strekalovsky - 3-20 Parallel global optimization on GPU
by Konstantin Barkalov & Victor Gergel - 65-82 Approximability of the minimum-weight k-size cycle cover problem
by Michael Khachay & Katherine Neznakhina - 83-94 Discrete-continuous optimization of heat network operating conditions in parallel operation of similar pumps at pumping stations
by N. N. Novitsky & A. V. Lutsenko
August 2016, Volume 65, Issue 4
- 637-655 Non polyhedral convex envelopes for 1-convex functions
by Marco Locatelli - 657-676 Projection algorithms for nonconvex minimization with application to sparse principal component analysis
by William W. Hager & Dzung T. Phan & Jiajie Zhu - 677-708 A stabilized filter SQP algorithm for nonlinear programming
by Chungen Shen & Lei-Hong Zhang & Wei Liu - 709-743 Packing ellipsoids by nonlinear optimization
by E. G. Birgin & R. D. Lobato & J. M. Martínez - 745-776 Bandwidth packing problem with queueing delays: modelling and exact solution approach
by Navneet Vidyarthi & Sachin Jayaswal & Vikranth Babu Tirumala Chetty - 777-799 Algorithms for the two-stage production-capacitated lot-sizing problem
by Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky - 801-811 Algorithms for the partial inverse matroid problem in which weights can only be increased
by Zhao Zhang & Shuangshuang Li & Hong-Jian Lai & Ding-Zhu Du - 813-835 A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
by Julliany S. Brandão & Thiago F. Noronha & Celso C. Ribeiro - 837-866 Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects
by Ignacio Araya & Victor Reyes
July 2016, Volume 65, Issue 3
- 441-456 Stochastic filter methods for generally constrained global optimization
by C. J. Price & M. Reale & B. L. Robertson - 457-486 Linear and parabolic relaxations for quadratic constraints
by Ferenc Domes & Arnold Neumaier - 487-512 Cumulative weighting optimization
by Kun Lin & Steven I. Marcus - 513-530 A sharp Lagrange multiplier theorem for nonlinear programs
by M. Ruiz Galán - 563-573 Existence and generic stability of cooperative equilibria for multi-leader-multi-follower games
by Zhe Yang & Yan Ju - 575-596 Functional inequalities, regularity and computation of the deficit and surplus variables in the financial equilibrium problem
by Patrizia Daniele & Sofia Giuffrè & Mariagrazia Lorino - 597-614 A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
by J. Y. Bello Cruz & R. Díaz Millán - 615-635 Coderivatives of implicit multifunctions and stability of variational systems
by Nguyen Thanh Qui
June 2016, Volume 65, Issue 2
- 309-327 Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem
by Francisco J. Aragón Artacho & Jonathan M. Borwein & Matthew K. Tam - 329-349 On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces
by Heinz H. Bauschke & Minh N. Dao & Dominikus Noll & Hung M. Phan - 351-367 A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
by Weifan Wang & Danjun Huang & Yanwen Wang & Yiqiao Wang & Ding-Zhu Du
May 2016, Volume 65, Issue 1
- 3-17 Saddle point approach to solving problem of optimal control with fixed ends
by Anatoly Antipin & Elena Khoroshilova - 33-39 Global optimization approach to Malfatti’s problem
by Rentsen Enkhbat
April 2016, Volume 64, Issue 4
- 621-622 Preface
by Nicolas Hadjisavvas & Alfredo N. Iusem & Boris S. Mordukhovich
March 2016, Volume 64, Issue 3
- 417-431 Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
by Yi Chen & David Gao - 433-449 A canonical duality approach for the solution of affine quasi-variational inequalities
by Vittorio Latorre & Simone Sagratella - 451-468 A new semi-smooth Newton multigrid method for control-constrained semi-linear elliptic PDE problems
by Jun Liu & Mingqing Xiao - 469-482 The robust constant and its applications in random global search for unconstrained global optimization
by Zheng Peng & Donghua Wu & Wenxing Zhu - 483-496 Combinatorial approximation algorithms for the robust facility location problem with penalties
by Fengmin Wang & Dachuan Xu & Chenchen Wu - 497-513 Gradient-constrained discounted Steiner trees I: optimal tree configurations
by K. Sirinanda & M. Brazil & P. Grossman & J. Rubinstein & D. Thomas - 515-532 Gradient-constrained discounted Steiner trees II: optimally locating a discounted Steiner point
by K. Sirinanda & M. Brazil & P. Grossman & J. Rubinstein & D. Thomas - 533-562 Second-order necessary optimality conditions for a discrete optimal control problem with mixed constraints
by N. Toan & L. Thuy - 563-575 Eigenvalue analysis of constrained minimization problem for homogeneous polynomial
by Yisheng Song & Liqun Qi - 577-613 Variable-fidelity modeling of structural analysis of assemblies
by Nicolas Courrier & Pierre-Alain Boucard & Bruno Soulier - 615-620 Approximate solutions of quasiequilibrium problems in Banach spaces
by M. Castellani & M. Giuli - 615-620 Approximate solutions of quasiequilibrium problems in Banach spaces
by M. Castellani & M. Giuli
February 2016, Volume 64, Issue 2
- 197-198 Preface: special issue MAGO 2014
by Leocadio G. Casado & Eligius M. T. Hendrix - 233-247 Solving a Huff-like Stackelberg location problem on networks
by Boglárka G.-Tóth & Kristóf Kovács - 289-304 Node selection strategies in interval Branch and Bound algorithms
by Bertrand Neveu & Gilles Trombettoni & Ignacio Araya
January 2016, Volume 64, Issue 1
- 1-2 Special issue on global optimization with multiple objectives
by Kaisa Miettinen & Jussi Hakanen & Dmitry Podkopaev & Ingrida Steponavice - 3-16 On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach
by Benjamin Martin & Alexandre Goldsztejn & Laurent Granvilliers & Christophe Jermann - 17-32 Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection
by Taimoor Akhtar & Christine Shoemaker - 33-48 Extracting from the relaxed for large-scale semi-continuous variable nondominated frontiers
by Ralph Steuer & Markus Hirschberger & Kalyanmoy Deb - 49-61 Generation of Pareto optimal solutions using generalized DEA and PSO
by Yeboon Yun & Hirotaka Nakayama & Min Yoon - 63-77 Lower bound sets for biobjective shortest path problems
by Enrique Machuca & Lawrence Mandow - 79-96 A scalarization proximal point method for quasiconvex multiobjective minimization
by H. Apolinário & E. Papa Quiroz & P. Oliveira - 97-115 Kriging-based infill sampling criterion for constraint handling in multi-objective optimization
by Jesús Martínez-Frutos & David Herrero-Pérez - 117-139 Duality related to approximate proper solutions of vector optimization problems
by C. Gutiérrez & L. Huerga & V. Novo & C. Tammer - 141-158 Prederivatives of convex set-valued maps and applications to set optimization problems
by Michaël Gaydu & Michel Geoffroy & Yvesner Marcelin