Content
Undated material is presented at the end, although it may be more recent than other items
July 2020, Volume 77, Issue 3
- 425-454 Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
by Yi Zhang & Nikolaos V. Sahinidis & Carlos Nohra & Gang Rong - 455-486 Mathematical programming formulations for piecewise polynomial functions
by Bjarne Grimstad & Brage R. Knudsen - 487-512 Global dynamic optimization using edge-concave underestimator
by Ishan Bajaj & M. M. Faruque Hasan - 513-541 Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
by Sunyoung Kim & Masakazu Kojima & Kim-Chuan Toh - 543-574 Subset selection for multiple linear regression via optimization
by Young Woong Park & Diego Klabjan - 575-602 Primal-dual analysis for online interval scheduling problems
by Ge Yu & Sheldon H. Jacobson - 603-625 Preprocessing algorithm and tightening constraints for multiperiod blend scheduling: cost minimization
by Yifu Chen & Christos T. Maravelias - 627-641 Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
by Nader Kanzi & Majid Soleimani-damaneh - 643-660 Damped Newton’s method on Riemannian manifolds
by Marcio Antônio de A. Bortoloti & Teles A. Fernandes & Orizon P. Ferreira & Jinyun Yuan - 661-685 Limiting Subdifferential Calculus and Perturbed Distance Function in Riemannian Manifolds
by M. Farrokhiniya & A. Barani
June 2020, Volume 77, Issue 2
- 197-225 New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
by R. Paulavičius & C. S. Adjiman - 227-272 Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
by Santanu S. Dey & Burak Kocuk & Asteroide Santana - 273-287 Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
by Nithirat Sisarat & Rabian Wangkeeree & Tamaki Tanaka - 289-300 Order cancellation law in the family of bounded convex sets
by J. Grzybowski & R. Urbański - 301-318 Globally minimizing the sum of a convex–concave fraction and a convex function based on wave-curve bounds
by Yong Xia & Longfei Wang & Xiaohui Wang - 319-340 Approximation algorithms for capacitated partial inverse maximum spanning tree problem
by Xianyue Li & Zhao Zhang & Ruowang Yang & Heping Zhang & Ding-Zhu Du - 341-359 An exact completely positive programming formulation for the discrete ordered median problem: an extended version
by J. Puerto - 361-382 Accelerated sampling Kaczmarz Motzkin algorithm for the linear feasibility problem
by Md Sarowar Morshed & Md Saiful Islam & Md. Noor-E-Alam - 383-403 An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm
by Francisco J. Aragón Artacho & Rubén Campoy & Veit Elser - 405-424 Linear conditioning, weak sharpness and finite convergence for equilibrium problems
by Luong Nguyen & Qamrul Hasan Ansari & Xiaolong Qin
May 2020, Volume 77, Issue 1
- 1-2 Preface: Special issue Europt 2018
by Eligius M. T. Hendrix & Leocadio G. Casado - 3-25 An algorithmic approach to multiobjective optimization with decision uncertainty
by Gabriele Eichfelder & Julia Niebling & Stefan Rocktäschel - 27-52 On generating the set of nondominated solutions of a linear programming problem with parameterized fuzzy numbers
by Manuel Arana-Jiménez & Carmen Sánchez-Gil - 53-73 Distributed algorithms for convex problems with linear coupling constraints
by Tommaso Colombo & Simone Sagratella - 75-96 The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
by Pavlo Muts & Ivo Nowak & Eligius M. T. Hendrix - 97-124 Block layer decomposition schemes for training deep neural networks
by Laura Palagi & Ruggiero Seccia - 125-141 On ill-posedness and stability of tensor variational inequalities: application to an economic equilibrium
by Annamaria Barbagallo & Serena Guarino Lo Bianco - 143-155 Optimality conditions for convex problems on intersections of non necessarily convex sets
by E. Allevi & J. E. Martínez-Legaz & R. Riccardi - 157-173 Global optimization of grillage-type foundations using a distributed genetic algorithm
by Mikalojus Ramanauskas & Dmitrij Šešok & Julius Žilinskas & Vadimas Starikovičius & Arnas Kačeniauskas & Rimantas Belevičius - 175-196 Packing ovals in optimized regular polygons
by Frank J. Kampas & János D. Pintér & Ignacio Castillo
April 2020, Volume 76, Issue 4
- 661-663 Preface: special issue of MOA 2018
by Ya-Feng Liu & Fengmin Xu & Neng Fan & Jiming Peng - 665-693 A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
by Kai Tu & Haibin Zhang & Huan Gao & Junkai Feng - 695-708 The seeding algorithms for spherical k-means clustering
by Min Li & Dachuan Xu & Dongmei Zhang & Juan Zou - 709-728 A Euclidean distance matrix model for protein molecular conformation
by Fengzhen Zhai & Qingna Li - 729-743 Non-submodular maximization on massive data streams
by Yijing Wang & Dachuan Xu & Yishui Wang & Dongmei Zhang - 745-768 A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
by Qian Liu & Yuqing Xu & Yang Zhou - 769-791 An active set Barzilar–Borwein algorithm for $$l_{0}$$l0 regularized optimization
by Wanyou Cheng & Zixin Chen & Qingjie Hu - 793-818 An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
by Jianlin Jiang & Su Zhang & Yibing Lv & Xin Du & Ziwei Yan - 819-840 Accelerated iterative hard thresholding algorithm for $$l_0$$l0 regularized regression problem
by Fan Wu & Wei Bian - 841-861 A derivative-free algorithm for spherically constrained optimization
by Min Xi & Wenyu Sun & Yannan Chen & Hailin Sun - 863-887 A Gauss–Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
by Xue Gao & Xingju Cai & Deren Han - 889-911 A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
by Minru Bai & Jing Zhao & ZhangHui Zhang - 913-932 Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
by Florian Jarre & Felix Lieder & Ya-Feng Liu & Cheng Lu
March 2020, Volume 76, Issue 3
- 453-454 Preface
by Alexander Kononov & Alexander Strekalovsky & Mikhail Posypkin & Artem Pyatkin - 455-470 Cooperation in dynamic multicriteria games with random horizons
by Anna N. Rettieva - 471-490 Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
by Akiyoshi Shioura & Natalia V. Shakhlevich & Vitaly A. Strusevich - 491-497 Approximating the 2-machine flow shop problem with exact delays taking two values
by Alexander Ageev - 499-518 A model for optimization of transport infrastructure for some homogeneous goods markets
by Alexander Vasin & Olesya Grigoryeva & Nikita Tsyganov - 519-531 A special three-level optimization problem
by S. Dempe & O. Khamisov & Yu. Kochetov - 533-543 Extension technology and extrema selections in a stochastic multistart algorithm for optimal control problems
by Alexander Yu. Gornov & Tatiana S. Zarodnyuk & Anton S. Anikin & Evgeniya A. Finkelstein - 545-562 The maximum independent union of cliques problem: complexity and exact approaches
by Zeynep Ertem & Eugene Lykhovyd & Yiming Wang & Sergiy Butenko - 563-574 Multidimensional frontier visualization based on optimization methods using parallel computations
by Alexander P. Afanasiev & Vladimir E. Krivonozhko & Andrey V. Lychev & Oleg V. Sukhoroslov - 575-586 Consensus and balancing on the three-sphere
by Aladin Crnkić & Vladimir Jaćimović - 587-612 On feedback strengthening of the maximum principle for measure differential equations
by Maxim Staritsyn & Stepan Sorokin - 613-623 Sparse solutions of optimal control via Newton method for under-determined systems
by Boris Polyak & Andrey Tremba - 625-644 Optimality conditions for optimal impulsive control problems with multipoint state constraints
by Olga N. Samsonyuk - 645-660 A puzzled driver is a better driver: enforcing speed limits using a randomization strategy
by Michael Dreyfuss & Irit Nowik
February 2020, Volume 76, Issue 2
- 243-244 Multi-objective optimization models in finance and investments
by Michalis Doumpos & Constantin Zopounidis - 245-265 An optimization–diversification approach to portfolio selection
by Francesco Cesarone & Andrea Scozzari & Fabio Tardella - 267-293 Global minimum variance portfolios under uncertainty: a robust optimization approach
by Sandra Caçador & Joana Matos Dias & Pedro Godinho - 295-315 Preference-based evolutionary multi-objective optimization for portfolio selection: a new credibilistic model under investor preferences
by Ana B. Ruiz & Rubén Saborido & José D. Bermúdez & Mariano Luque & Enriqueta Vercher - 317-331 Tailor-made thematic portfolios: a core satellite optimization
by Florian Methling & Rüdiger Nitzsch - 333-346 A stochastic goal programming model to derive stable cash management policies
by Francisco Salas-Molina & Juan A. Rodriguez-Aguilar & David Pla-Santamaria - 347-382 The joint replenishment problem with trade credits
by Jen-Yen Lin & Ming-Jong Yao - 383-405 Inner approximating the completely positive cone via the cone of scaled diagonally dominant matrices
by João Gouveia & Ting Kei Pong & Mina Saee - 407-431 Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization
by Javad Koushki & Majid Soleimani-damaneh - 433-452 Convergence analysis of a projection algorithm for variational inequality problems
by Biao Qu & Changyu Wang & Fanwen Meng
January 2020, Volume 76, Issue 1
- 1-24 Convex envelope of bivariate cubic functions over rectangular regions
by Marco Locatelli - 25-55 New global optimality conditions for nonsmooth DC optimization problems
by M. V. Dolgopolik - 57-67 Optimality conditions for an exhausterable function on an exhausterable set
by Majid E. Abbasov - 69-90 On the choice of the low-dimensional domain for global optimization via random embeddings
by Mickaël Binois & David Ginsbourger & Olivier Roustant - 91-120 Steklov regularization and trajectory methods for univariate global optimization
by Orhan Arıkan & Regina S. Burachik & C. Yalçın Kaya - 121-135 Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
by Van-Bong Nguyen & Thi Ngan Nguyen & Ruey-Lin Sheu - 137-153 A residual-based algorithm for solving a class of structured nonsmooth optimization problems
by Lei Wu - 155-188 The decompositions with respect to two core non-symmetric cones
by Yue Lu & Ching-Yu Yang & Jein-Shan Chen & Hou-Duo Qi - 189-209 Solving k-center problems involving sets based on optimization techniques
by Nguyen Thai An & Nguyen Mau Nam & Xiaolong Qin - 211-241 Multimode resource-constrained project scheduling in flexible projects
by Zsolt T. Kosztyán & István Szalkai
December 2019, Volume 75, Issue 4
- 885-919 A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
by T. D. Chuong & V. Jeyakumar & G. Li - 921-947 A finite $$\epsilon $$ϵ-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
by Can Li & Ignacio E. Grossmann - 949-971 A manifold-based approach to sparse global constraint satisfaction problems
by Ali Baharev & Arnold Neumaier & Hermann Schichl - 973-1002 Noisy Euclidean distance matrix completion with a single missing node
by Stefan Sremac & Fei Wang & Henry Wolkowicz & Lucas Pettersson - 1003-1028 Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
by Yaohua Hu & Carisa Kwok Wai Yu & Xiaoqi Yang - 1029-1060 Inexact proximal $$\epsilon $$ϵ-subgradient methods for composite convex optimization problems
by R. Díaz Millán & M. Pentón Machado - 1061-1077 Stability of a convex feasibility problem
by Carlo Alberto Bernardi & Enrico Miglierina & Elena Molho - 1079-1109 Surrogate-assisted Bounding-Box approach for optimization problems with tunable objectives fidelity
by M. Rivier & P. M. Congedo - 1111-1131 Online hole healing for sensor coverage
by Zhao Zhang & Zaixin Lu & Xianyue Li & Xiaohui Huang & Ding-Zhu Du - 1133-1146 Approximation algorithm for the partial set multi-cover problem
by Yishuo Shi & Yingli Ran & Zhao Zhang & James Willson & Guangmo Tong & Ding-Zhu Du
November 2019, Volume 75, Issue 3
- 565-593 Tighter McCormick relaxations through subgradient propagation
by Jaromił Najman & Alexander Mitsos - 595-629 A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
by Emmanuel Ogbe & Xiang Li - 631-654 Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
by Masaki Kimizuka & Sunyoung Kim & Makoto Yamashita - 655-681 A new algorithm for concave quadratic programming
by Moslem Zamani - 683-733 Solving the equality-constrained minimization problem of polynomial functions
by Shuijing Xiao & Guangxing Zeng - 735-766 Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems
by Michel Minoux & Riadh Zorgati - 767-787 On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
by Bo Wen & Xiaoping Xue - 789-811 Generalized polyhedral convex optimization problems
by Nguyen Ngoc Luan & Jen-Chih Yao - 813-831 Convergence and correctness of belief propagation for the Chinese postman problem
by Guowei Dai & Fengwei Li & Yuefang Sun & Dachuan Xu & Xiaoyan Zhang - 833-849 Parametric monotone function maximization with matroid constraints
by Suning Gong & Qingqin Nong & Wenjing Liu & Qizhi Fang - 851-883 Systemic risk governance in a dynamical model of a banking system
by Lorella Fatone & Francesca Mariani
October 2019, Volume 75, Issue 2
- 227-245 Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
by Paula Alexandra Amaral & Immanuel M. Bomze - 247-272 A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
by Can Li & Ignacio E. Grossmann - 273-339 Fractional 0–1 programs: links between mixed-integer linear and conic quadratic formulations
by Erfan Mehmanchi & Andrés Gómez & Oleg A. Prokopyev - 341-392 Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
by Hatim Djelassi & Moll Glass & Alexander Mitsos - 393-416 A scalable global optimization algorithm for stochastic nonlinear programs
by Yankai Cao & Victor M. Zavala - 417-437 A hierarchy of semidefinite relaxations for completely positive tensor optimization problems
by Anwa Zhou & Jinyan Fan - 439-460 Global supply chain networks and tariff rate quotas: equilibrium analysis with application to agricultural products
by Anna Nagurney & Deniz Besik & Ladimer S. Nagurney - 461-494 Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
by Rujun Jiang & Duan Li - 495-522 Packing ellipses in an optimized convex polygon
by A. Pankratov & T. Romanova & I. Litvinchev - 523-563 Proximal bundle methods for nonsmooth DC programming
by Welington Oliveira
September 2019, Volume 75, Issue 1
- 1-2 Preface on the Special Issue Global Optimization with Multiple Criteria: Theory, Methods and Applications
by Kaisa Miettinen & Francisco Ruiz - 3-34 Efficient computation of expected hypervolume improvement using box decomposition algorithms
by Kaifeng Yang & Michael Emmerich & André Deutz & Thomas Bäck - 35-62 An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
by Ozgu Turgut & Evrim Dalkiran & Alper E. Murat - 63-90 Nonmonotone line searches for unconstrained multiobjective optimization problems
by Kanako Mita & Ellen H. Fukuda & Nobuo Yamashita - 91-110 Nonlinear biobjective optimization: improvements to interval branch & bound algorithms
by Ignacio Araya & Jose Campusano & Damir Aliquintui - 111-129 Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems
by Elena Constantin - 131-141 Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem
by M. Chinaie & F. Fakhar & M. Fakhar & H. R. Hajisharifi - 143-161 Coherent weights for pairwise comparison matrices and a mixed-integer linear programming problem
by Bice Cavallo - 163-176 A coercivity condition for nonmonotone quasiequilibria on finite-dimensional spaces
by M. Castellani & M. Giuli - 177-197 Quasi-equilibrium problems with non-self constraint map
by John Cotrina & Javier Zúñiga - 199-225 Trajectory optimization using quantum computing
by Alok Shukla & Prakash Vedula
August 2019, Volume 74, Issue 4
- 597-598 Preface
by Sergiy Butenko & Efstratios N. Pistikopoulos - 599-609 Bi-objective decision making in global optimization based on statistical models
by Antanas Žilinskas & James Calvin - 611-637 Tuning BARON using derivative-free optimization algorithms
by Jianfeng Liu & Nikolaos Ploskas & Nikolaos V. Sahinidis - 639-675 An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs
by Harsha Nagarajan & Mowen Lu & Site Wang & Russell Bent & Kaarthik Sundar - 677-703 On tightness and anchoring of McCormick and other relaxations
by Jaromił Najman & Alexander Mitsos - 705-735 A multi-term, polyhedral relaxation of a 0–1 multilinear function for Boolean logical pattern generation
by Kedong Yan & Hong Seo Ryoo - 737-751 Geometric conditions of reduction of exhausters
by Majid E. Abbasov - 753-782 Invex optimization revisited
by Ksenia Bestuzheva & Hassan Hijazi - 783-801 On the chance-constrained minimum spanning k-core problem
by Juan Ma & Balabhaskar Balasundaram - 803-838 Critical nodes in interdependent networks with deterministic and probabilistic cascading failures
by Alexander Veremyev & Konstantin Pavlikov & Eduardo L. Pasiliao & My T. Thai & Vladimir Boginski - 839-859 A cutting plane method for risk-constrained traveling salesman problem with random arc costs
by Zhouchun Huang & Qipeng Phil Zheng & Eduardo Pasiliao & Vladimir Boginski & Tao Zhang - 861-877 Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
by Rundong Du & Barry Drake & Haesun Park - 879-908 Joint production and transportation scheduling in flexible manufacturing systems
by Dalila B. M. M. Fontes & Seyed Mahdi Homayouni - 909-932 Local search approximation algorithms for the sum of squares facility location problems
by Dongmei Zhang & Dachuan Xu & Yishui Wang & Peng Zhang & Zhenning Zhang
July 2019, Volume 74, Issue 3
- 417-442 Facets of a mixed-integer bilinear covering set with bounds on variables
by Hamidur Rahman & Ashutosh Mahajan - 443-465 Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems
by Styliani Avraamidou & Efstratios N. Pistikopoulos - 467-476 Large proper gaps in bin packing and dual bin packing problems
by Vadim M. Kartak & Artem V. Ripatti - 477-493 Solving the multistage PMU placement problem by integer programming and equivalent network design model
by Ou Sun & Neng Fan - 495-522 Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions
by Britta Schulze & Kathrin Klamroth & Michael Stiglmayr - 523-548 On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems
by Shuvomoy Das Gupta & Lacra Pavel - 549-564 Variable neighborhood search for stochastic linear programming problem with quantile criterion
by Sergey V. Ivanov & Andrey I. Kibzun & Nenad Mladenović & Dragan Urošević - 565-596 Optimal control problems with states of bounded variation and hysteresis
by Olga N. Samsonyuk & Sergey A. Timoshin
June 2019, Volume 74, Issue 2
- 213-231 NAUTILUS Navigator: free search interactive multiobjective optimization without trading-off
by Ana B. Ruiz & Francisco Ruiz & Kaisa Miettinen & Laura Delgado-Antequera & Vesa Ojalehto - 233-253 Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems
by Washington Alves Oliveira & Marko Antonio Rojas-Medar & Antonio Beato-Moreno & Maria Beatriz Hernández-Jiménez - 255-284 Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
by H. Boualam & A. Roubi - 285-295 Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras
by M. Seetharama Gowda - 297-325 Solving inverse optimal control problems via value functions to global optimality
by Stephan Dempe & Felix Harder & Patrick Mehlitz & Gerd Wachsmuth - 327-359 Two-layer adaptive surrogate-assisted evolutionary algorithm for high-dimensional computationally expensive problems
by Zan Yang & Haobo Qiu & Liang Gao & Chen Jiang & Jinhao Zhang - 361-382 Variants of the Ekeland variational principle for approximate proper solutions of vector equilibrium problems
by L. P. Hai & L. Huerga & P. Q. Khanh & V. Novo - 383-399 Stability in unified semi-infinite vector optimization
by Shiva Kapoor & C. S. Lalitha - 401-415 When is there a representer theorem?
by Kevin Schlegel
May 2019, Volume 74, Issue 1
- 1-20 Enhancing interval constraint propagation by identifying and filtering n-ary subsystems
by Ignacio Araya & Victor Reyes - 21-44 Minimum variance allocation among constrained intervals
by Hsin-Min Sun & Ruey-Lin Sheu - 45-62 On three soft rectangle packing problems with guillotine constraints
by Quoc Trung Bui & Thibaut Vidal & Minh Hoàng Hà - 63-77 Application of the DIRECT algorithm to searching for an optimal k-partition of the set $$\mathcal {A}\subset \mathbb {R}^n$$ A ⊂ R n and its application to the multiple circle detection problem
by Rudolf Scitovski & Kristian Sabo - 79-93 The Douglas–Rachford algorithm for a hyperplane and a doubleton
by Heinz H. Bauschke & Minh N. Dao & Scott B. Lindstrom - 95-119 Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
by Howard Heaton & Yair Censor - 121-160 A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality
by Sorin-Mihai Grad & Oleg Wilfer - 161-168 Necessary optimality conditions for a nonsmooth semi-infinite programming problem
by Nazih Abderrazzak Gadhi - 169-193 The locally Chen–Harker–Kanzow–Smale smoothing functions for mixed complementarity problems
by Zhengyong Zhou & Yunchan Peng - 195-211 A unified minimal solution in set optimization
by Khushboo & C. S. Lalitha
April 2019, Volume 73, Issue 4
- 677-699 Lifted polymatroid inequalities for mean-risk optimization with indicator variables
by Alper Atamtürk & Hyemin Jeon - 701-722 Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
by Tiago Andrade & Fabricio Oliveira & Silvio Hamacher & Andrew Eberhard - 723-759 Packing circles into perimeter-minimizing convex hulls
by Josef Kallrath & Markus M. Frey - 761-788 On the complexity of quasiconvex integer minimization problem
by A. Yu. Chirkov & D. V. Gribanov & D. S. Malyshev & P. M. Pardalos & S. I. Veselov & N. Yu. Zolotykh - 789-800 A mixed integer programming approach to the tensor complementarity problem
by Shouqiang Du & Liping Zhang - 801-824 MiKM: multi-step inertial Krasnosel’skiǐ–Mann algorithm and its applications
by Q. L. Dong & J. Z. Huang & X. H. Li & Y. J. Cho & Th. M. Rassias - 825-847 Generalized forward–backward splitting with penalization for monotone inclusion problems
by Nimit Nimana & Narin Petrot - 849-868 A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
by Le Hai Yen & Nguyen Thi Thanh Huyen & Le Dung Muu - 869-889 Properties of the nonlinear scalar functional and its applications to vector optimization problems
by Ying Gao & Xin-Min Yang - 891-913 On the hierarchical structure of Pareto critical sets
by Bennet Gebken & Sebastian Peitz & Michael Dellnitz
March 2019, Volume 73, Issue 3
- 467-483 Tighter $$\alpha $$ α BB relaxations through a refinement scheme for the scaled Gerschgorin theorem
by Dimitrios Nerantzis & Claire S. Adjiman - 485-514 SDP-based branch-and-bound for non-convex quadratic integer optimization
by Christoph Buchheim & Maribel Montenegro & Angelika Wiegele - 515-535 A generic interval branch and bound algorithm for parameter estimation
by Bertrand Neveu & Martin Gorce & Pascal Monasse & Gilles Trombettoni - 537-545 On the spherical convexity of quadratic functions
by O. P. Ferreira & S. Z. Németh - 547-565 Rigorous packing of unit squares into a circle
by Tiago Montanher & Arnold Neumaier & Mihály Csaba Markót & Ferenc Domes & Hermann Schichl - 567-581 A topological convergence on power sets well-suited for set optimization
by Michel H. Geoffroy - 583-613 Efficient global optimization of constrained mixed variable problems
by Julien Pelamatti & Loïc Brevault & Mathieu Balesdent & El-Ghazali Talbi & Yannick Guerin - 615-636 Conditional optimization of a noisy function using a kriging metamodel
by Diariétou Sambakhé & Lauriane Rouan & Jean-Noël Bacro & Eric Gozé - 637-657 Novel self-adaptive algorithms for non-Lipschitz equilibrium problems with applications
by Pham Ky Anh & Trinh Ngoc Hai - 659-673 Revisiting norm optimization for multi-objective black-box problems: a finite-time analysis
by Abdullah Al-Dujaili & S. Suresh - 675-676 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
by John R. Birge
February 2019, Volume 73, Issue 2
- 239-277 Global optimization issues in deep network regression: an overview
by Laura Palagi - 279-310 A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
by Hoai An Le Thi & Vinh Thanh Ho & Tao Pham Dinh - 311-330 A fast algorithm for globally solving Tikhonov regularized total least squares problem
by Yong Xia & Longfei Wang & Meijia Yang - 331-348 Iteration-complexity analysis of a generalized alternating direction method of multipliers
by V. A. Adona & M. L. N. Gonçalves & J. G. Melo - 349-369 Geometric properties for level sets of quadratic functions
by Huu-Quang Nguyen & Ruey-Lin Sheu - 371-388 A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
by Cheng Lu & Zhibin Deng & Jing Zhou & Xiaoling Guo - 389-410 Robot path planning in a dynamic environment with stochastic measurements
by Adriano Zanin Zambom & Brian Seguin & Feifei Zhao - 411-429 An inexact splitting method for the subspace segmentation from incomplete and noisy observations
by Renli Liang & Yanqin Bai & Hai Xiang Lin - 431-446 Mixed integer quadratic optimization formulations for eliminating multicollinearity based on variance inflation factor
by Ryuta Tamura & Ken Kobayashi & Yuichi Takano & Ryuhei Miyashiro & Kazuhide Nakata & Tomomi Matsui - 447-463 Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior
by Meenakshi Gupta & Manjari Srivastava - 465-465 Correction to: Optimal deterministic algorithm generation
by Alexander Mitsos & Jaromił Najman & Ioannis G. Kevrekidis
January 2019, Volume 73, Issue 1
- 1-25 Global optimization of generalized semi-infinite programs using disjunctive programming
by Peter Kirst & Oliver Stein - 27-57 A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs
by Dajun Yue & Jiyao Gao & Bo Zeng & Fengqi You - 59-81 Spectral projected gradient method for stochastic optimization
by Nataša Krejić & Nataša Krklec Jerinkić - 83-112 A Lyapunov-type approach to convergence of the Douglas–Rachford algorithm for a nonconvex setting
by Minh N. Dao & Matthew K. Tam - 113-151 Convergence-order analysis for differential-inequalities-based bounds and relaxations of the solutions of ODEs
by Spencer D. Schaber & Joseph K. Scott & Paul I. Barton - 153-169 The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
by Xiaoni Chi & M. Seetharama Gowda & Jiyuan Tao - 171-192 A Bayesian optimization approach to find Nash equilibria
by Victor Picheny & Mickael Binois & Abderrahmane Habbal - 193-221 The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint
by Baohua Huang & Changfeng Ma - 223-237 Numbers of the connected components of the solution sets of monotone affine vector variational inequalities
by Vu Trung Hieu