Printed from https://ideas.repec.org/s/spr/jglopt4.html
Content
July 2019, Volume 74, Issue 3
- 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
December 2018, Volume 72, Issue 4
- 603-618 Maximum-entropy sampling and the Boolean quadric polytope
by Kurt M. Anstreicher - 619-653 Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
by N. Ito & S. Kim & M. Kojima & A. Takeda & K.-C. Toh - 655-678 Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
by T. D. Chuong & V. Jeyakumar - 679-704 Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
by Yulan Liu & Shujun Bi & Shaohua Pan - 705-729 A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique
by W. Geremew & N. M. Nam & A. Semenov & V. Boginski & E. Pasiliao - 731-742 Tractability of convex vector optimization problems in the sense of polyhedral approximations
by Firdevs Ulus - 743-760 Variational inequality formulation for the games with random payoffs
by Vikas Vikram Singh & Abdel Lisser - 761-779 A class of differential hemivariational inequalities in Banach spaces
by Stanisław Migórski & Shengda Zeng - 781-801 Methods to compare expensive stochastic optimization algorithms with random restarts
by Warren Hare & Jason Loeppky & Shangwei Xie
November 2018, Volume 72, Issue 3
- 373-402 Globally solving a class of optimal power flow problems in radial networks by tree reduction
by Amir Beck & Yuval Beck & Yoash Levron & Alex Shtof & Luba Tetruashvili - 403-429 Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
by Outi Montonen & Kaisa Joki - 431-441 A note on the Douglas–Rachford splitting method for optimization problems involving hypoconvex functions
by Ke Guo & Deren Han - 443-474 Linear convergence of the generalized Douglas–Rachford algorithm for feasibility problems
by Minh N. Dao & Hung M. Phan - 475-490 On upper approximations of Pareto fronts
by I. Kaliszewski & J. Miroforidis - 491-515 Enhancing quantum efficiency of thin-film silicon solar cells by Pareto optimality
by Andrea Patanè & Andrea Santoro & Vittorio Romano & Antonino La Magna & Giuseppe Nicosia - 517-538 The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
by Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos - 539-552 Optimal channel assignment and L(p, 1)-labeling
by Junlei Zhu & Yuehua Bu & Miltiades P. Pardalos & Hongwei Du & Huijuan Wang & Bin Liu - 553-577 An abstract proximal point algorithm
by Laurenţiu Leuştean & Adriana Nicolae & Andrei Sipoş - 579-590 Limit vector variational inequality problems via scalarization
by M. Bianchi & I. V. Konnov & R. Pini - 591-601 On maximal monotonicity of bifunctions on Hadamard manifolds
by J. X. Cruz Neto & F. M. O. Jacinto & P. A. Soares & J. C. O. Souza
October 2018, Volume 72, Issue 2
- 129-153 On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
by Emily Speakman & Jon Lee - 155-179 Unifying local–global type properties in vector optimization
by Ovidiu Bagdasar & Nicolae Popovici - 181-217 A simplicial homology algorithm for Lipschitz optimisation
by Stefan C. Endres & Carl Sandrock & Walter W. Focke - 219-240 A nonconvex quadratic optimization approach to the maximum edge weight clique problem
by Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko - 241-254 Exploiting algebraic structure in global optimization and the Belgian chocolate problem
by Zachary Charles & Nigel Boston - 255-276 Global optimization of nonconvex problems with convex-transformable intermediates
by Carlos J. Nohra & Nikolaos V. Sahinidis - 277-303 Convex envelopes of bivariate functions through the solution of KKT systems
by Marco Locatelli - 305-321 Decomposition-based Inner- and Outer-Refinement Algorithms for Global Optimization
by Ivo Nowak & Norman Breitfeld & Eligius M. T. Hendrix & Grégoire Njacheun-Njanzoua - 323-345 MultiGLODS: global and local multiobjective optimization using direct search
by A. L. Custódio & J. F. A. Madeira - 347-372 A vector linear programming approach for certain global optimization problems
by Daniel Ciripoi & Andreas Löhne & Benjamin Weißing
September 2018, Volume 72, Issue 1
- 1-4 Preface: Special issue dedicated to Distance Geometry
by Farid Alizadeh & Douglas Gonçalves & Nathan Krislock & Leo Liberti - 5-26 Low-rank matrix completion using nuclear norm minimization and facial reduction
by Shimeng Huang & Henry Wolkowicz - 27-53 The minimum distance superset problem: formulations and algorithms
by Leonardo Fontoura & Rafael Martinelli & Marcus Poggi & Thibaut Vidal - 55-70 A new algorithm for the small-field astrometric point-pattern matching problem
by Cláudio P. Santiago & Carlile Lavor & Sérgio Assunção Monteiro & Alberto Kroner-Martins - 71-87 Minimal curvature-constrained networks
by D. Kirszenblat & K. G. Sirinanda & M. Brazil & P. A. Grossman & J. H. Rubinstein & D. A. Thomas - 89-107 Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
by Luiz H. Cherri & Adriana C. Cherri & Edilaine M. Soler - 109-127 Tuning interval Branch-and-Prune for protein structure determination
by Bradley Worley & Florent Delhommel & Florence Cordier & Thérèse E. Malliavin & Benjamin Bardiaux & Nicolas Wolff & Michael Nilges & Carlile Lavor & Leo Liberti
August 2018, Volume 71, Issue 4
- 651-653 In memoriam: Professor Christodoulos A. Floudas (1959–2016)
by Efstratios N. Pistikopoulos - 655-690 Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
by Radu Baltean-Lugojan & Ruth Misener - 691-716 Global optimization of MIQCPs with dynamic piecewise relaxations
by Pedro A. Castillo Castillo & Pedro M. Castro & Vladimir Mahalec - 717-733 A symmetry-based splitting strategy for discretizable distance geometry problems
by Felipe Fidalgo & Douglas S. Gonçalves & Carlile Lavor & Leo Liberti & Antonio Mucherino - 735-752 An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems
by M. M. Faruque Hasan - 753-813 Convergence-order analysis of branch-and-bound algorithms for constrained problems
by Rohit Kannan & Paul I. Barton - 815-844 Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains
by N. Kazazakis & C. S. Adjiman - 845-869 Optimization of black-box problems using Smolyak grids and polynomial approximations
by Chris A. Kieslich & Fani Boukouvala & Christodoulos A. Floudas - 871-889 Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
by Cristiana L. Lara & Francisco Trespalacios & Ignacio E. Grossmann - 891-913 Optimal deterministic algorithm generation
by Alexander Mitsos & Jaromił Najman & Ioannis G. Kevrekidis - 915-934 A computational study of global optimization solvers on two trust region subproblems
by Tiago Montanher & Arnold Neumaier & Ferenc Domes - 935-955 A customized branch-and-bound approach for irregular shape nesting
by Akang Wang & Christopher L. Hanselman & Chrysanthos E. Gounaris - 957-985 Surrogate-based feasibility analysis for black-box stochastic simulations with heteroscedastic noise
by Zilong Wang & Marianthi Ierapetritou - 987-1011 On solving generalized convex MINLP problems using supporting hyperplane techniques
by Tapio Westerlund & Ville-Pekka Eronen & Marko M. Mäkelä - 1013-1013 Preface of the Special JOGO issue in Memory of Professor Christodoulos A. Floudas (1959–2016)
by Ignacio Grossmann & Panos Pardalos
July 2018, Volume 71, Issue 3
- 441-442 Preface to the Special Issue “GOW’16”
by Ana Maria A. C. Rocha & M. Fernanda P. Costa & Edite M. G. P. Fernandes - 443-455 Testing pseudoconvexity via interval computation
by Milan Hladík - 457-482 Extensions on ellipsoid bounds for quadratic integer programming
by Marcia Fampa & Francisco Pinillos Nieto - 483-500 lsmear: a variable selection strategy for interval branch and bound solvers
by Ignacio Araya & Bertrand Neveu - 501-515 Feasibility pump for aircraft deconfliction with speed regulation
by Sonia Cafieri & Claudia D’Ambrosio - 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