Computational Optimization and Applications

2006 - 2023

Current editor(s): William W. Hager

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 75, issue 3, 2020

Preface to the special issue on optimization with polynomials and tensors pp. 607-608

Jiawang Nie

On the tensor spectral p-norm and its dual norm via partitions pp. 609-628

Bilian Chen and Zhening Li

A semidefinite relaxation method for second-order cone polynomial complementarity problems pp. 629-647

Lulu Cheng and Xinzhen Zhang

Stochastic structured tensors to stochastic complementarity problems pp. 649-668

Shouqiang Du, Maolin Che and Yimin Wei

On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems pp. 669-699

Feng Guo and Xiaoxia Sun

An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors pp. 701-737

Shenglong Hu

SDP relaxation algorithms for $$\mathbf {P}(\mathbf {P}_0)$$P(P0)-tensor detection pp. 739-752

Xiao Wang, Xinzhen Zhang and Guangming Zhou

Tensor neural network models for tensor singular value decompositions pp. 753-777

Xuezhong Wang, Maolin Che and Yimin Wei

Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement pp. 779-798

Mengshi Zhang, Guyan Ni and Guofeng Zhang

Higher-degree tensor eigenvalue complementarity problems pp. 799-816

Ruixue Zhao and Jinyan Fan

Saddle points of rational functions pp. 817-832

Guangming Zhou, Qin Wang and Wenjie Zhao

Volume 75, issue 2, 2020

A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs pp. 321-360

Enrico Bettiol, Lucas Létocart, Francesco Rinaldi and Emiliano Traversi

Optimally linearizing the alternating direction method of multipliers for convex programming pp. 361-388

Bingsheng He, Feng Ma and Xiaoming Yuan

Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms pp. 389-422

M. Marques Alves, Jonathan Eckstein, Marina Geremia and Jefferson G. Melo

A self-adaptive method for pseudomonotone equilibrium problems and variational inequalities pp. 423-440

Jun Yang and Hongwei Liu

Secant update version of quasi-Newton PSB with weighted multisecant equations pp. 441-466

Nicolas Boutet, Rob Haelterman and Joris Degroote

A line search exact penalty method for nonlinear semidefinite programming pp. 467-491

Qi Zhao and Zhongwen Chen

A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems pp. 493-513

Ken Kobayashi and Yuich Takano

Fast feasibility check of the multi-material vertical alignment problem in road design pp. 515-536

Dominique Monnet, Warren Hare and Yves Lucet

Solution methods for a min–max facility location problem with regional customers considering closest Euclidean distances pp. 537-560

Nazlı Dolu, Umur Hastürk and Mustafa Kemal Tural

Empirical study of exact algorithms for the multi-objective spanning tree pp. 561-605

I. F. C. Fernandes, E. F. G. Goldbarg, S. M. D. M. Maia and M. C. Goldbarg

Volume 75, issue 1, 2020

Multiscale stochastic optimization: modeling aspects and scenario generation pp. 1-34

Martin Glanzer and Georg Ch. Pflug

Markov chain block coordinate descent pp. 35-61

Tao Sun, Yuejiao Sun, Yangyang Xu and Wotao Yin

Restarting the accelerated coordinate descent method with a rough strong convexity estimate pp. 63-91

Olivier Fercoq and Zheng Qu

A global hybrid derivative-free method for high-dimensional systems of nonlinear equations pp. 93-112

Rodolfo G. Begiato, Ana L. Custódio and Márcia A. Gomes-Ruggiero

A unified convergence framework for nonmonotone inexact decomposition methods pp. 113-144

Leonardo Galli, Alessandro Galligari and Marco Sciandrone

An improved Dai–Kou conjugate gradient algorithm for unconstrained optimization pp. 145-167

Zexian Liu, Hongwei Liu and Yu-Hong Dai

Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization pp. 169-205

C. P. Brás, J. M. Martínez and M. Raydan

Modified Jacobian smoothing method for nonsmooth complementarity problems pp. 207-235

Pin-Bo Chen, Peng Zhang, Xide Zhu and Gui-Hua Lin

Rank-two update algorithm versus Frank–Wolfe algorithm with away steps for the weighted Euclidean one-center problem pp. 237-262

Wei-jie Cong, Le Wang and Hui Sun

A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems pp. 263-290

Glaydston Carvalho Bento, Sandro Dimy Barbosa Bitar, João Xavier Cruz Neto, Antoine Soubeyran and João Carlos Oliveira Souza

Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance pp. 291-320

Hanane Krim, Rachid Benmansour, David Duvivier, Daoud Aït-Kadi and Said Hanafi

Volume 74, issue 3, 2019

Solution refinement at regular points of conic problems pp. 627-643

Enzo Busseti, Walaa M. Moursi and Stephen Boyd

Mesh adaptive direct search with simplicial Hessian update pp. 645-667

Árpád Bűrmen and Iztok Fajfar

Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints pp. 669-701

Johannes J. Brust, Roummel F. Marcia and Cosmin G. Petra

Exact spectral-like gradient method for distributed optimization pp. 703-728

Dušan Jakovetić, Nataša Krejić and Nataša Krklec Jerinkić

A delayed weighted gradient method for strictly convex quadratic minimization pp. 729-746

Harry Fernando Oviedo Leon

Douglas–Rachford splitting and ADMM for pathological convex optimization pp. 747-778

Ernest K. Ryu, Yanli Liu and Wotao Yin

Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants pp. 779-820

Aswin Kannan and Uday V. Shanbhag

Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets pp. 821-850

Xiaolong Qin and Nguyen Thai An

An auction-based approach for the re-optimization shortest path tree problem pp. 851-893

P. Festa, F. Guerriero and A. Napoletano

Two new integer linear programming formulations for the vertex bisection problem pp. 895-918

Norberto Castillo-García and Paula Hernández Hernández

An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series pp. 919-948

Leonardo Di Gangi, M. Lapucci, F. Schoen and A. Sortino

Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications pp. 949-949

Zhi Wang, K. Droegemeier and L. White

Volume 74, issue 2, 2019

On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems pp. 317-344

Hikaru Komeiji, Sunyoung Kim and Makoto Yamashita

Additive and restricted additive Schwarz–Richardson methods for inequalities with nonlinear monotone operators pp. 345-385

Lori Badea

Computing the spark: mixed-integer programming for the (vector) matroid girth problem pp. 387-441

Andreas M. Tillmann

A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization pp. 443-480

Najmeh Hoseini Monjezi and S. Nobakhtian

A novel convex dual approach to three-dimensional assignment problem: theoretical analysis pp. 481-516

Jingqun Li, R. Tharmarasa, Daly Brown, Thia Kirubarajan and Krishna R. Pattipati

Minimizing the average searching time for an object within a graph pp. 517-545

Ron Teller, Moshe Zofi and Moshe Kaspi

Modified inexact Levenberg–Marquardt methods for solving nonlinear least squares problems pp. 547-582

Jifeng Bao, Carisa Kwok Wai Yu, Jinhua Wang, Yaohua Hu and Jen-Chih Yao

Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence pp. 583-621

Chee-Khian Sim

Volume 74, issue 1, 2019

On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems pp. 1-42

Wim Ackooij, Welington Oliveira and Yongjia Song

A family of spectral gradient methods for optimization pp. 43-65

Yu-Hong Dai, Yakui Huang and Xin-Wei Liu

Non-stationary Douglas–Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence pp. 67-92

Dirk A. Lorenz and Quoc Tran-Dinh

Quasi-Newton approaches to interior point methods for quadratic problems pp. 93-120

J. Gondzio and F. N. C. Sobral

A dense initialization for limited-memory quasi-Newton methods pp. 121-142

Johannes Brust, Oleg Burdakov, Jennifer B. Erway and Roummel F. Marcia

Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning pp. 143-176

Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya and Ken Hayami

A subspace SQP method for equality constrained optimization pp. 177-194

Jae Hwa Lee, Yoon Mo Jung, Ya-xiang Yuan and Sangwoon Yun

A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint pp. 195-223

A. Taati and M. Salahi

A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs pp. 225-258

Pedro Merino

Bounds for integration matrices that arise in Gauss and Radau collocation pp. 259-273

Wanchun Chen, Wenhao Du, William W. Hager and Liang Yang

Convergence rate for a Radau hp collocation method applied to constrained optimal control pp. 275-314

William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao and Xiang-Sheng Wang

Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control pp. 315-316

William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao and Xiang-Sheng Wang