Content
Undated material is presented at the end, although it may be more recent than other items
June 2020, Volume 76, Issue 2
- 277-303 Numerically tractable optimistic bilevel problems
by Lorenzo Lampariello & Simone Sagratella - 305-346 An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
by Weiwei Kong & Jefferson G. Melo & Renato D. C. Monteiro - 347-380 Accelerating incremental gradient optimization with curvature information
by Hoi-To Wai & Wei Shi & César A. Uribe & Angelia Nedić & Anna Scaglione - 381-430 Inexact first-order primal–dual algorithms
by Julian Rasch & Antonin Chambolle - 431-460 Quantitative analysis for a class of two-stage stochastic linear variational inequality problems
by Jie Jiang & Xiaojun Chen & Zhiping Chen - 461-498 Algorithms for stochastic optimization with function or expectation constraints
by Guanghui Lan & Zhiqiang Zhou - 499-533 The Pontryagin maximum principle for solving Fokker–Planck optimal control problems
by Tim Breitenbach & Alfio Borzì - 535-569 Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
by Si-Tong Lu & Miao Zhang & Qing-Na Li - 571-588 A differentiable path-following algorithm for computing perfect stationary points
by Yang Zhan & Peixuan Li & Chuangyin Dang - 589-614 A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
by Kevin C. Furman & Nicolas W. Sawaya & Ignacio E. Grossmann
May 2020, Volume 76, Issue 1
- 1-31 A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging
by Pooriya Beyhaghi & Ryan Alimo & Thomas Bewley - 33-68 A dual spectral projected gradient method for log-determinant semidefinite problems
by Takashi Nakagaki & Mituhiro Fukuda & Sunyoung Kim & Makoto Yamashita - 69-124 Composite convex optimization with global and local inexact oracles
by Tianxiao Sun & Ion Necoara & Quoc Tran-Dinh - 125-153 A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
by Li-Ping Pang & Qi Wu & Jin-He Wang & Qiong Wu - 155-199 Error estimates for the finite element approximation of bilinear boundary control problems
by Max Winkler - 201-232 Efficient local search procedures for quadratic fractional programming problems
by Luca Consolini & Marco Locatelli & Jiulin Wang & Yong Xia - 233-275 A comparison of solution approaches for the numerical treatment of or-constrained optimization problems
by Patrick Mehlitz
April 2020, Volume 75, Issue 3
- 607-608 Preface to the special issue on optimization with polynomials and tensors
by Jiawang Nie - 609-628 On the tensor spectral p-norm and its dual norm via partitions
by Bilian Chen & Zhening Li - 629-647 A semidefinite relaxation method for second-order cone polynomial complementarity problems
by Lulu Cheng & Xinzhen Zhang - 649-668 Stochastic structured tensors to stochastic complementarity problems
by Shouqiang Du & Maolin Che & Yimin Wei - 669-699 On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
by Feng Guo & Xiaoxia Sun - 701-737 An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
by Shenglong Hu - 739-752 SDP relaxation algorithms for $$\mathbf {P}(\mathbf {P}_0)$$P(P0)-tensor detection
by Xiao Wang & Xinzhen Zhang & Guangming Zhou - 753-777 Tensor neural network models for tensor singular value decompositions
by Xuezhong Wang & Maolin Che & Yimin Wei - 779-798 Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement
by Mengshi Zhang & Guyan Ni & Guofeng Zhang - 799-816 Higher-degree tensor eigenvalue complementarity problems
by Ruixue Zhao & Jinyan Fan - 817-832 Saddle points of rational functions
by Guangming Zhou & Qin Wang & Wenjie Zhao
March 2020, Volume 75, Issue 2
- 321-360 A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
by Enrico Bettiol & Lucas Létocart & Francesco Rinaldi & Emiliano Traversi - 361-388 Optimally linearizing the alternating direction method of multipliers for convex programming
by Bingsheng He & Feng Ma & Xiaoming Yuan - 389-422 Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
by M. Marques Alves & Jonathan Eckstein & Marina Geremia & Jefferson G. Melo - 423-440 A self-adaptive method for pseudomonotone equilibrium problems and variational inequalities
by Jun Yang & Hongwei Liu - 441-466 Secant update version of quasi-Newton PSB with weighted multisecant equations
by Nicolas Boutet & Rob Haelterman & Joris Degroote - 467-491 A line search exact penalty method for nonlinear semidefinite programming
by Qi Zhao & Zhongwen Chen - 493-513 A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
by Ken Kobayashi & Yuich Takano - 515-536 Fast feasibility check of the multi-material vertical alignment problem in road design
by Dominique Monnet & Warren Hare & Yves Lucet - 537-560 Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances
by Nazlı Dolu & Umur Hastürk & Mustafa Kemal Tural - 561-605 Empirical study of exact algorithms for the multi-objective spanning tree
by I. F. C. Fernandes & E. F. G. Goldbarg & S. M. D. M. Maia & M. C. Goldbarg
January 2020, Volume 75, Issue 1
- 1-34 Multiscale stochastic optimization: modeling aspects and scenario generation
by Martin Glanzer & Georg Ch. Pflug - 35-61 Markov chain block coordinate descent
by Tao Sun & Yuejiao Sun & Yangyang Xu & Wotao Yin - 63-91 Restarting the accelerated coordinate descent method with a rough strong convexity estimate
by Olivier Fercoq & Zheng Qu - 93-112 A global hybrid derivative-free method for high-dimensional systems of nonlinear equations
by Rodolfo G. Begiato & Ana L. Custódio & Márcia A. Gomes-Ruggiero - 113-144 A unified convergence framework for nonmonotone inexact decomposition methods
by Leonardo Galli & Alessandro Galligari & Marco Sciandrone - 145-167 An improved Dai–Kou conjugate gradient algorithm for unconstrained optimization
by Zexian Liu & Hongwei Liu & Yu-Hong Dai - 169-205 Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
by C. P. Brás & J. M. Martínez & M. Raydan - 207-235 Modified Jacobian smoothing method for nonsmooth complementarity problems
by Pin-Bo Chen & Peng Zhang & Xide Zhu & Gui-Hua Lin - 237-262 Rank-two update algorithm versus Frank–Wolfe algorithm with away steps for the weighted Euclidean one-center problem
by Wei-jie Cong & Le Wang & Hui Sun - 263-290 A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
by Glaydston Carvalho Bento & Sandro Dimy Barbosa Bitar & João Xavier Cruz Neto & Antoine Soubeyran & João Carlos Oliveira Souza - 291-320 Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance
by Hanane Krim & Rachid Benmansour & David Duvivier & Daoud Aït-Kadi & Said Hanafi
December 2019, Volume 74, Issue 3
- 627-643 Solution refinement at regular points of conic problems
by Enzo Busseti & Walaa M. Moursi & Stephen Boyd - 645-667 Mesh adaptive direct search with simplicial Hessian update
by Árpád Bűrmen & Iztok Fajfar - 669-701 Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints
by Johannes J. Brust & Roummel F. Marcia & Cosmin G. Petra - 703-728 Exact spectral-like gradient method for distributed optimization
by Dušan Jakovetić & Nataša Krejić & Nataša Krklec Jerinkić - 729-746 A delayed weighted gradient method for strictly convex quadratic minimization
by Harry Fernando Oviedo Leon - 747-778 Douglas–Rachford splitting and ADMM for pathological convex optimization
by Ernest K. Ryu & Yanli Liu & Wotao Yin - 779-820 Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
by Aswin Kannan & Uday V. Shanbhag - 821-850 Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
by Xiaolong Qin & Nguyen Thai An - 851-893 An auction-based approach for the re-optimization shortest path tree problem
by P. Festa & F. Guerriero & A. Napoletano - 895-918 Two new integer linear programming formulations for the vertex bisection problem
by Norberto Castillo-García & Paula Hernández Hernández - 919-948 An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
by Leonardo Di Gangi & M. Lapucci & F. Schoen & A. Sortino - 949-949 Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
by Zhi Wang & K. Droegemeier & L. White
November 2019, Volume 74, Issue 2
- 317-344 On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
by Hikaru Komeiji & Sunyoung Kim & Makoto Yamashita - 345-385 Additive and restricted additive Schwarz–Richardson methods for inequalities with nonlinear monotone operators
by Lori Badea - 387-441 Computing the spark: mixed-integer programming for the (vector) matroid girth problem
by Andreas M. Tillmann - 443-480 A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
by Najmeh Hoseini Monjezi & S. Nobakhtian - 481-516 A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
by Jingqun Li & R. Tharmarasa & Daly Brown & Thia Kirubarajan & Krishna R. Pattipati - 517-545 Minimizing the average searching time for an object within a graph
by Ron Teller & Moshe Zofi & Moshe Kaspi - 547-582 Modified inexact Levenberg–Marquardt methods for solving nonlinear least squares problems
by Jifeng Bao & Carisa Kwok Wai Yu & Jinhua Wang & Yaohua Hu & Jen-Chih Yao - 583-621 Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence
by Chee-Khian Sim
September 2019, Volume 74, Issue 1
- 1-42 On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
by Wim Ackooij & Welington Oliveira & Yongjia Song - 43-65 A family of spectral gradient methods for optimization
by Yu-Hong Dai & Yakui Huang & Xin-Wei Liu - 67-92 Non-stationary Douglas–Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
by Dirk A. Lorenz & Quoc Tran-Dinh - 93-120 Quasi-Newton approaches to interior point methods for quadratic problems
by J. Gondzio & F. N. C. Sobral - 121-142 A dense initialization for limited-memory quasi-Newton methods
by Johannes Brust & Oleg Burdakov & Jennifer B. Erway & Roummel F. Marcia - 143-176 Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
by Yiran Cui & Keiichi Morikuni & Takashi Tsuchiya & Ken Hayami - 177-194 A subspace SQP method for equality constrained optimization
by Jae Hwa Lee & Yoon Mo Jung & Ya-xiang Yuan & Sangwoon Yun - 195-223 A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
by A. Taati & M. Salahi - 225-258 A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs
by Pedro Merino - 259-273 Bounds for integration matrices that arise in Gauss and Radau collocation
by Wanchun Chen & Wenhao Du & William W. Hager & Liang Yang - 275-314 Convergence rate for a Radau hp collocation method applied to constrained optimal control
by William W. Hager & Hongyan Hou & Subhashree Mohapatra & Anil V. Rao & Xiang-Sheng Wang - 315-316 Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control
by William W. Hager & Hongyan Hou & Subhashree Mohapatra & Anil V. Rao & Xiang-Sheng Wang
July 2019, Volume 73, Issue 3
- 707-753 A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
by E. G. Birgin & J. M. Martínez - 755-790 Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces
by Eike Börgens & Christian Kanzow - 791-819 Robust optimal discrete arc sizing for tree-shaped potential networks
by Martin Robinius & Lars Schewe & Martin Schmidt & Detlef Stolten & Johannes Thürauf & Lara Welder - 821-837 An algorithm for equilibrium selection in generalized Nash equilibrium problems
by Axel Dreves - 839-869 A parameterized Douglas–Rachford algorithm
by Dongying Wang & Xianfu Wang - 871-901 On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
by Feng Ma - 903-912 A simple convergence analysis of Bregman proximal gradient algorithm
by Yi Zhou & Yingbin Liang & Lixin Shen - 913-932 Modified extragradient-like algorithms with new stepsizes for variational inequalities
by Dang Hieu & Pham Ky Anh & Le Dung Muu - 933-956 The Uzawa-MBB type algorithm for nonsymmetric saddle point problems
by Zhitao Xu & Li Gao - 957-996 Convergence of a stabilized SQP method for equality constrained optimization
by Songqiang Qiu - 997-1017 Maximum–norm a posteriori error estimates for an optimal control problem
by Enrique Otárola & Richard Rankin & Abner J. Salgado - 1019-1019 Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications
by Zhi Wang & K. Droegemeier & L. White
June 2019, Volume 73, Issue 2
- 353-386 Iteratively reweighted $$\ell _1$$ ℓ 1 algorithms with extrapolation
by Peiran Yu & Ting Kei Pong - 387-410 Empirical risk minimization: probabilistic complexity and stepsize strategy
by Chin Pang Ho & Panos Parpas - 411-452 An almost cyclic 2-coordinate descent method for singly linearly constrained problems
by Andrea Cristofari - 453-476 A singular value p-shrinkage thresholding algorithm for low rank matrix recovery
by Yu-Fan Li & Kun Shang & Zheng-Hai Huang - 477-508 A semismooth Newton method for support vector classification and regression
by Juan Yin & Qingna Li - 509-534 A sub-additive DC approach to the complementarity problem
by L. Abdallah & M. Haddou & T. Migot - 535-574 Optimized choice of parameters in interior-point methods for linear programming
by Luiz-Rafael Santos & Fernando Villas-Bôas & Aurelio R. L. Oliveira & Clovis Perin - 575-601 Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs
by Lluís-Miquel Munguía & Geoffrey Oxberry & Deepak Rajan & Yuji Shinano - 603-645 Ordered p-median problems with neighbourhoods
by Víctor Blanco - 647-677 Markov–Dubins interpolating curves
by C. Yalçın Kaya - 679-705 Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design
by Jean-Thomas Camino & Christian Artigues & Laurent Houssin & Stéphane Mourgues
May 2019, Volume 73, Issue 1
- 1-35 Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
by Nicholas I. M. Gould & Tyrone Rees & Jennifer A. Scott - 37-67 A new approximation hierarchy for polynomial conic optimization
by Peter J. C. Dickinson & Janez Povh - 69-100 A refined convergence analysis of $$\hbox {pDCA}_{e}$$ pDCA e with applications to simultaneous sparse recovery and outlier detection
by Tianxiang Liu & Ting Kei Pong & Akiko Takeda - 101-128 Graph-based algorithms for the efficient solution of optimization problems involving monotone functions
by Luca Consolini & Mattia Laurini & Marco Locatelli - 129-158 General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
by Zhongming Wu & Min Li - 159-199 Fast bundle-level methods for unconstrained and ball-constrained convex optimization
by Yunmei Chen & Guanghui Lan & Yuyuan Ouyang & Wei Zhang - 201-235 Inexact alternating direction methods of multipliers for separable convex optimization
by William W. Hager & Hongchao Zhang - 237-273 Projective method of multipliers for linearly constrained convex minimization
by Majela Pentón Machado - 275-310 A strong Lagrangian relaxation for general discrete-choice network revenue management
by Sumit Kunnumkal & Kalyan Talluri - 311-352 PAL-Hom method for QP and an application to LP
by Guoqiang Wang & Bo Yu
April 2019, Volume 72, Issue 3
- 525-559 Direct search based on probabilistic feasible descent for bound and linearly constrained problems
by S. Gratton & C. W. Royer & L. N. Vicente & Z. Zhang - 561-588 Efficient calculation of regular simplex gradients
by Ian Coope & Rachael Tappenden - 589-608 An algorithm for binary linear chance-constrained problems using IIS
by Gianpiero Canessa & Julian A. Gallego & Lewis Ntaimo & Bernardo K. Pagnoncelli - 609-640 Accelerating block coordinate descent methods with identification strategies
by R. Lopes & S. A. Santos & P. J. S. Silva - 641-674 Inexact Successive quadratic approximation for regularized optimization
by Ching-pei Lee & Stephen J. Wright - 675-705 A framework for parallel second order incremental optimization algorithms for solving partially separable problems
by Kamer Kaya & Figen Öztoprak & Ş. İlker Birbil & A. Taylan Cemgil & Umut Şimşekli & Nurdan Kuru & Hazal Koptagel & M. Kaan Öztürk - 707-726 A random block-coordinate Douglas–Rachford splitting method with low computational complexity for binary logistic regression
by Luis M. Briceño-Arias & Giovanni Chierchia & Emilie Chouzenoux & Jean-Christophe Pesquet - 727-768 A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
by M. Paul Laiu & André L. Tits - 769-795 Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
by Leonid Faybusovich & Cunlu Zhou - 797-826 Optimal control in first-order Sobolev spaces with inequality constraints
by Yu Deng & Patrick Mehlitz & Uwe Prüfert - 827-848 Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
by Huizhen Zhang & Cesar Beltran-Royo & Bo Wang & Ziying Zhang
March 2019, Volume 72, Issue 2
- 293-308 Cholesky QR-based retraction on the generalized Stiefel manifold
by Hiroyuki Sato & Kensuke Aihara - 309-337 A feasible rounding approach for mixed-integer optimization problems
by Christoph Neumann & Oliver Stein & Nathan Sudermann-Merx - 339-361 Proximal gradient methods for multiobjective optimization and their applications
by Hiroki Tanabe & Ellen H. Fukuda & Nobuo Yamashita - 363-390 A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
by Baha Alzalg - 391-412 A simple version of bundle method with linear programming
by Shuai Liu - 413-430 Solving optimal control problems with terminal complementarity constraints via Scholtes’ relaxation scheme
by Francisco Benita & Patrick Mehlitz - 431-456 A partial outer convexification approach to control transmission lines
by S. Göttlich & A. Potschka & C. Teuber - 457-478 Adaptive $$l_1$$ l 1 -regularization for short-selling control in portfolio selection
by Stefania Corsaro & Valentina Simone - 479-498 An iterative method for solving a bi-objective constrained portfolio optimization problem
by Madani Bezoui & Mustapha Moulaï & Ahcène Bounceur & Reinhardt Euler - 499-524 A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques
by M. Ahmadvand & M. Esmaeilbeigi & A. Kamandi & F. M. Yaghoobi
January 2019, Volume 72, Issue 1
- 1-43 Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
by Quoc Tran-Dinh - 45-85 On monotone and primal-dual active set schemes for $$\ell ^p$$ ℓ p -type problems, $$p \in (0,1]$$ p ∈ ( 0 , 1 ]
by Daria Ghilli & Karl Kunisch - 87-113 Asynchronous parallel primal–dual block coordinate update methods for affinely constrained convex programs
by Yangyang Xu - 115-157 Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
by Bo Jiang & Tianyi Lin & Shiqian Ma & Shuzhong Zhang - 159-177 Newton’s method with feasible inexact projections for solving constrained generalized equations
by Fabiana R. Oliveira & Orizon P. Ferreira & Gilson N. Silva - 179-213 Convergence of the augmented decomposition algorithm
by Hongsheng Liu & Shu Lu - 215-239 A globally convergent Levenberg–Marquardt method for equality-constrained optimization
by A. F. Izmailov & M. V. Solodov & E. I. Uskov - 241-267 A homogeneous model for monotone mixed horizontal linear complementarity problems
by Cosmin G. Petra & Florian A. Potra - 269-292 On the optimal solution set in interval linear programming
by Elif Garajová & Milan Hladík
December 2018, Volume 71, Issue 3
- 613-640 A specialized primal-dual interior point method for the plastic truss layout optimization
by Alemseged Gebrehiwot Weldeyesus & Jacek Gondzio - 641-671 Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case
by Aimé Kamgaing Kuiteing & Patrice Marcotte & Gilles Savard - 673-717 A fast gradient and function sampling method for finite-max functions
by Elias S. Helou & Sandra A. Santos & Lucas E. A. Simões - 719-741 A new reduced gradient method for solving linearly constrained multiobjective optimization problems
by Mustapha El Moudden & Ahmed El Ghali - 743-765 On inexact ADMMs with relative error criteria
by Jiaxin Xie - 767-794 Proximal primal–dual best approximation algorithm with memory
by E. M. Bednarczuk & A. Jezierska & K. E. Rutkowski - 795-828 A majorization–minimization algorithm for split feasibility problems
by Jason Xu & Eric C. Chi & Meng Yang & Kenneth Lange - 829-855 An exact and heuristic approach for the d-minimum branch vertices problem
by Jorge Moreno & Yuri Frota & Simone Martins - 857-878 Error estimates for the approximation of multibang control problems
by Christian Clason & Thi Bich Tram Do & Frank Pörner - 879-913 A convergence analysis of the method of codifferential descent
by M. V. Dolgopolik
November 2018, Volume 71, Issue 2
- 307-329 A progressive barrier derivative-free trust-region algorithm for constrained optimization
by Charles Audet & Andrew R. Conn & Sébastien Le Digabel & Mathilde Peyrega - 331-352 Mesh-based Nelder–Mead algorithm for inequality constrained optimization
by Charles Audet & Christophe Tribes - 353-380 A penalty method for rank minimization problems in symmetric matrices
by Xin Shen & John E. Mitchell - 381-402 A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
by Yang Zhan & Chuangyin Dang - 403-433 Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
by Yoshihiro Kanno - 435-456 Duality of nonconvex optimization with positively homogeneous functions
by Shota Yamanaka & Nobuo Yamashita - 457-482 Exact augmented Lagrangian functions for nonlinear semidefinite programming
by Ellen H. Fukuda & Bruno F. Lourenço - 483-508 Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
by Petra Renáta Rigó & Zsolt Darvay - 509-523 Finding a best approximation pair of points for two polyhedra
by Ron Aharoni & Yair Censor & Zilin Jiang - 525-551 A two-level metaheuristic for the all colors shortest path problem
by F. Carrabs & R. Cerulli & R. Pentangelo & A. Raiconi - 553-608 Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
by Guanglei Wang & Hassan Hijazi
September 2018, Volume 71, Issue 1
- 1-3 Introduction to the special issue for SIMAI 2016
by Valeria Ruggiero & Gerardo Toraldo - 5-52 A block coordinate variable metric linesearch based proximal gradient method
by S. Bonettini & M. Prato & S. Rebegoldi - 53-72 A multi-objective DIRECT algorithm for ship hull optimization
by E. F. Campana & M. Diez & G. Liuzzi & S. Lucidi & R. Pellegrini & V. Piccialli & F. Rinaldi & A. Serani - 73-93 Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming
by Renato De Leone & Giovanni Fasano & Yaroslav D. Sergeyev - 95-113 Modified Fejér sequences and applications
by Junhong Lin & Lorenzo Rosasco & Silvia Villa & Ding-Xuan Zhou - 115-145 Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training
by Andrea Manno & Laura Palagi & Simone Sagratella - 147-170 Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
by Leopoldo Marini & Benedetta Morini & Margherita Porcelli - 171-191 Reconstruction of 3D X-ray CT images from reduced sampling by a scaled gradient projection algorithm
by E. Loli Piccolomini & V. L. Coli & E. Morotti & L. Zanni - 193-219 Algorithms for positive semidefinite factorization
by Arnaud Vandaele & François Glineur & Nicolas Gillis - 221-250 A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization
by Norikazu Takahashi & Jiro Katayama & Masato Seki & Jun’ichi Takeuchi - 251-271 An effective adaptive trust region algorithm for nonsmooth minimization
by Zhou Sheng & Gonglin Yuan - 273-306 A non-overlapping DDM combined with the characteristic method for optimal control problems governed by convection–diffusion equations
by Tongjun Sun & Keying Ma
July 2018, Volume 70, Issue 3
- 641-675 Combinatorial optimal control of semilinear elliptic PDEs
by Christoph Buchheim & Renke Kuhlmann & Christian Meyer - 677-707 Optimal control of a class of reaction–diffusion systems
by Eduardo Casas & Christopher Ryll & Fredi Tröltzsch - 709-736 Proximal algorithms and temporal difference methods for solving fixed point problems
by Dimitri P. Bertsekas - 737-762 A generalized projection-based scheme for solving convex constrained optimization problems
by Aviv Gibali & Karl-Heinz Küfer & Daniel Reem & Philipp Süss - 763-790 Complexity of the relaxed Peaceman–Rachford splitting method for the sum of two maximal strongly monotone operators
by Renato D. C. Monteiro & Chee-Khian Sim - 791-826 A class of ADMM-based algorithms for three-block separable convex programming
by Bingsheng He & Xiaoming Yuan - 827-839 The generalized proximal point algorithm with step size 2 is not necessarily convergent
by Min Tao & Xiaoming Yuan - 841-863 A convergent relaxation of the Douglas–Rachford algorithm
by Nguyen Hieu Thao - 865-888 On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
by Laureano F. Escudero & María Araceli Garín & Celeste Pizarro & Aitziber Unzueta - 889-910 A multi-criteria approach to approximate solution of multiple-choice knapsack problem
by Ewa M. Bednarczuk & Janusz Miroforidis & Przemysław Pyzel
June 2018, Volume 70, Issue 2
- 321-350 Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems
by Bethany L. Nicholson & Wei Wan & Shivakumar Kameswaran & Lorenz T. Biegler - 351-394 A flexible coordinate descent method
by Kimon Fountoulakis & Rachael Tappenden - 395-418 A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
by Hao Jiang & Daniel P. Robinson & René Vidal & Chong You - 419-441 Completely positive tensor recovery with minimal nuclear value
by Anwa Zhou & Jinyan Fan - 443-478 A primal-dual homotopy algorithm for $$\ell _{1}$$ ℓ 1 -minimization with $$\ell _{\infty }$$ ℓ ∞ -constraints
by Christoph Brauer & Dirk A. Lorenz & Andreas M. Tillmann - 479-502 Chance-constrained economic dispatch with renewable energy and storage
by Jianqiang Cheng & Richard Li-Yang Chen & Habib N. Najm & Ali Pinar & Cosmin Safta & Jean-Paul Watson - 503-530 Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
by Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz - 531-569 Adaptive optimal control of Signorini’s problem
by Andreas Rademacher & Korinna Rosin - 571-592 Efficiently solving total least squares with Tikhonov identical regularization
by Meijia Yang & Yong Xia & Jiulin Wang & Jiming Peng - 593-613 A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions
by Tasnuva Haque & Yves Lucet - 615-639 A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms
by Gabriel Haeser
May 2018, Volume 70, Issue 1
- 1-32 Real eigenvalues of nonsymmetric tensors
by Jiawang Nie & Xinzhen Zhang - 33-59 A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
by Guanglin Xu & Samuel Burer - 61-90 Time-optimal velocity planning by a bound-tightening technique
by Federico Cabassi & Luca Consolini & Marco Locatelli