Journal: Comp. Opt. and Appl.

Volume 74, Issue 3

623 -- 626. COAP 2018 Best Paper Prize
627 -- 643Enzo Busseti, Walaa M. Moursi, Stephen P. Boyd. Solution refinement at regular points of conic problems
645 -- 667Árpád Bürmen, Iztok Fajfar. Mesh adaptive direct search with simplicial Hessian update
669 -- 701Johannes Brust, Roummel F. Marcia, Cosmin G. Petra. Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints
703 -- 728Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic. Exact spectral-like gradient method for distributed optimization
729 -- 746Harry Fernando Oviedo Leon. A delayed weighted gradient method for strictly convex quadratic minimization
747 -- 778Ernest K. Ryu, Yanli Liu 0003, Wotao Yin. Douglas-Rachford splitting and ADMM for pathological convex optimization
779 -- 820Aswin Kannan, Uday V. Shanbhag. Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants
821 -- 850Xiaolong Qin, Nguyen Thai An. Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
851 -- 893Paola Festa, Francesca Guerriero, Antonio Napoletano. An auction-based approach for the re-optimization shortest path tree problem
895 -- 918Norberto Castillo-García, Paula Hernández Hernández. Two new integer linear programming formulations for the vertex bisection problem
919 -- 948Leonardo Di Gangi, Matteo Lapucci, Fabio Schoen, Alessio Sortino. An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series
949 -- 0Zhi Wang, Kelvin Droegemeier, Luther W. White. Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications

Volume 74, Issue 2

317 -- 344Hikaru Komeiji, Sunyoung Kim, Makoto Yamashita. On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
345 -- 385Lori Badea. Additive and restricted additive Schwarz-Richardson methods for inequalities with nonlinear monotone operators
387 -- 441Andreas M. Tillmann. Computing the spark: mixed-integer programming for the (vector) matroid girth problem
443 -- 480Najmeh Hoseini Monjezi, S. Nobakhtian. A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
481 -- 516Jingqun Li, Ratnasingham Tharmarasa, Daly Brown, Thia Kirubarajan, Krishna R. Pattipati. A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
517 -- 545Ron Teller, Moshe Zofi, Moshe Kaspi. Minimizing the average searching time for an object within a graph
547 -- 582Jifeng Bao, Carisa Kwok Wai Yu, Jinhua Wang, Yaohua Hu, Jen-Chih Yao. Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
583 -- 621Chee-Khian Sim. Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence

Volume 74, Issue 1

1 -- 42Wim van Ackooij, Welington de Oliveira, Yongjia Song. On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
43 -- 65Yu-Hong Dai, Yakui Huang, Xinwei Liu. A family of spectral gradient methods for optimization
67 -- 92Dirk A. Lorenz, Quoc Tran-Dinh. Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence
93 -- 120Jacek Gondzio, F. N. C. Sobral. Quasi-Newton approaches to interior point methods for quadratic problems
121 -- 142Johannes Brust, Oleg Burdakov, Jennifer B. Erway, Roummel F. Marcia. A dense initialization for limited-memory quasi-Newton methods
143 -- 176Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya, Ken Hayami. Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
177 -- 194Jae-Hwa Lee, Yoon Mo Jung, Ya-Xiang Yuan, Sangwoon Yun. A subspace SQP method for equality constrained optimization
195 -- 223Akram Taati, Maziar Salahi. A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
225 -- 258Pedro Merino 0002. A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs
259 -- 273Wanchun Chen, Wenhao Du, William W. Hager, Liang Yang. Bounds for integration matrices that arise in Gauss and Radau collocation
275 -- 314William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang. Convergence rate for a Radau hp collocation method applied to constrained optimal control
315 -- 316William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang. Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control