Economics at your fingertips  

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 79, issue 3, 2021

Subspace quadratic regularization method for group sparse multinomial logistic regression pp. 531-559 Downloads
Rui Wang, Naihua Xiu and Kim-Chuan Toh
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems pp. 561-599 Downloads
G. Liuzzi, M. Locatelli, V. Piccialli and S. Rass
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint pp. 601-631 Downloads
F. J. Hwang and Yao-Huei Huang
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming pp. 633-648 Downloads
R. Andreani, E. H. Fukuda, G. Haeser, D. O. Santos and L. D. Secchin
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems pp. 649-679 Downloads
Jiaming Liang, Renato D. C. Monteiro and Chee-Khian Sim
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization pp. 681-715 Downloads
Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis and Panagiotis Patrinos
Fastest rates for stochastic mirror descent methods pp. 717-766 Downloads
Filip Hanzely and Peter Richtárik
A dual simplex-type algorithm for the smallest enclosing ball of balls pp. 767-787 Downloads
Marta Cavaleiro and Farid Alizadeh
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function pp. 789-816 Downloads
David Ek and Anders Forsgren

Volume 79, issue 2, 2021

Matrix optimization based Euclidean embedding with outliers pp. 235-271 Downloads
Qian Zhang, Xinyuan Zhao and Chao Ding
Low-rank factorization for rank minimization with nonconvex regularizers pp. 273-300 Downloads
April Sagan and John E. Mitchell
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization pp. 301-338 Downloads
Jean Bigeon, Sébastien Le Digabel and Ludovic Salomon
A stochastic subspace approach to gradient-free optimization in high dimensions pp. 339-368 Downloads
David Kozak, Stephen Becker, Alireza Doostan and Luis Tenorio
Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences pp. 369-404 Downloads
Majid Jahani, Naga Venkata C. Gudapati, Chenxin Ma, Rachael Tappenden and Martin Takáč
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization pp. 405-440 Downloads
Filip Hanzely, Peter Richtárik and Lin Xiao
A Laplacian approach to $$\ell _1$$ ℓ 1 -norm minimization pp. 441-469 Downloads
Vincenzo Bonifaci
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems pp. 471-506 Downloads
Rujun Jiang, Man-Chung Yue and Zhishuo Zhou
The circumcentered-reflection method achieves better rates than alternating projections pp. 507-530 Downloads
Reza Arefidamghani, Roger Behling, Yunier Bello-Cruz, Alfredo N. Iusem and Luiz-Rafael Santos

Volume 79, issue 1, 2021

Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates pp. 1-34 Downloads
Charles Audet, Kwassi Joseph Dzahini, Michael Kokkolaras and Sébastien Le Digabel
Generating set search using simplex gradients for bound-constrained black-box optimization pp. 35-65 Downloads
Sander Dedoncker, Wim Desmet and Frank Naets
A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure pp. 67-99 Downloads
Haodong Yu, Jie Sun and Yanjun Wang
Quantitative results on a Halpern-type proximal point algorithm pp. 101-125 Downloads
Laurenţiu Leuştean and Pedro Pinto
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions pp. 127-154 Downloads
Shummin Nakayama, Yasushi Narushima and Hiroshi Yabe
Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization pp. 155-191 Downloads
David Ek and Anders Forsgren
Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation pp. 193-221 Downloads
Sven Leyffer, Paul Manns and Malte Winckler
MINLP formulations for continuous piecewise linear function fitting pp. 223-233 Downloads
Noam Goldberg, Steffen Rebennack, Youngdae Kim, Vitaliy Krasko and Sven Leyffer

Volume 78, issue 3, 2021

Decomposition Algorithms for Some Deterministic and Two-Stage Stochastic Single-Leader Multi-Follower Games pp. 675-704 Downloads
Pedro Borges, Claudia Sagastizábal and Mikhail Solodov
Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces pp. 705-740 Downloads
Caroline Geiersbach and Teresa Scarinci
Conditional gradient method for multiobjective optimization pp. 741-768 Downloads
P. B. Assunção, O. P. Ferreira and L. F. Prudente
The Tikhonov regularization for vector equilibrium problems pp. 769-792 Downloads
Lam Quoc Anh, Tran Quoc Duy, Le Dung Muu and Truong Van Tri
Gauss–Newton-type methods for bilevel optimization pp. 793-824 Downloads
Jörg Fliege, Andrey Tin and Alain Zemkoho
A proximal DC approach for quadratic assignment problem pp. 825-851 Downloads
Zhuoxuan Jiang, Xinyuan Zhao and Chao Ding
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem pp. 853-891 Downloads
Xinxin Li, Ting Kei Pong, Hao Sun and Henry Wolkowicz
Polyhedral approximations of the semidefinite cone and their application pp. 893-913 Downloads
Yuzhu Wang, Akihiro Tanaka and Akiko Yoshise
On the properties of the cosine measure and the uniform angle subspace pp. 915-952 Downloads
Rommel G. Regis
Secant Update generalized version of PSB: a new approach pp. 953-982 Downloads
Nicolas Boutet, Rob Haelterman and Joris Degroote

Volume 78, issue 2, 2021

An interior point-proximal method of multipliers for convex quadratic programming pp. 307-351 Downloads
Spyridon Pougkakiotis and Jacek Gondzio
Using partial spectral information for block diagonal preconditioning of saddle-point systems pp. 353-375 Downloads
Alison Ramage, Daniel Ruiz, Annick Sartenaer and Charlotte Tannier
Globalized inexact proximal Newton-type methods for nonconvex composite functions pp. 377-410 Downloads
Christian Kanzow and Theresa Lechner
Nonconvex robust programming via value-function optimization pp. 411-450 Downloads
Ying Cui, Ziyu He and Jong-Shi Pang
A bundle method for nonsmooth DC programming with application to chance-constrained problems pp. 451-490 Downloads
W. Ackooij, S. Demassey, P. Javal, H. Morais, W. Oliveira and B. Swaminathan
Finding multi-objective supported efficient spanning trees pp. 491-528 Downloads
Pedro Correia, Luís Paquete and José Rui Figueira
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials pp. 529-557 Downloads
Jiawang Nie, Xindong Tang and Lingling Xu
Tensor Z-eigenvalue complementarity problems pp. 559-573 Downloads
Meilan Zeng
On mixed-integer optimal control with constrained total variation of the integer control pp. 575-623 Downloads
Sebastian Sager and Clemens Zeile
Theoretical and numerical comparison of the Karush–Kuhn–Tucker and value function reformulations in bilevel optimization pp. 625-674 Downloads
Alain B. Zemkoho and Shenglong Zhou

Volume 78, issue 1, 2021

An accelerated active-set algorithm for a quadratic semidefinite program with general constraints pp. 1-42 Downloads
Chungen Shen, Yunlong Wang, Wenjuan Xue and Lei-Hong Zhang
Tractable ADMM schemes for computing KKT points and local minimizers for $$\ell _0$$ ℓ 0 -minimization problems pp. 43-85 Downloads
Yue Xie and Uday V. Shanbhag
Convergence study on strictly contractive Peaceman–Rachford splitting method for nonseparable convex minimization models with quadratic coupling terms pp. 87-124 Downloads
Peixuan Li, Yuan Shen, Suhong Jiang, Zehua Liu and Caihua Chen
Single-forward-step projective splitting: exploiting cocoercivity pp. 125-166 Downloads
Patrick R. Johnstone and Jonathan Eckstein
Properties of the delayed weighted gradient method pp. 167-180 Downloads
Roberto Andreani and Marcos Raydan
Implementing and modifying Broyden class updates for large scale optimization pp. 181-203 Downloads
Martin Buhmann and Dirk Siegel
Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems pp. 205-238 Downloads
Yannan Chen, Hailin Sun and Huifu Xu
T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming pp. 239-272 Downloads
Meng-Meng Zheng, Zheng-Hai Huang and Yong Wang
Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations pp. 273-286 Downloads
A. Fischer, A. F. Izmailov and M. V. Solodov
An efficient algorithm for nonconvex-linear minimax optimization problem and its application in solving weighted maximin dispersion problem pp. 287-306 Downloads
Weiwei Pan, Jingjing Shen and Zi Xu
Page updated 2023-06-06