default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 79
Volume 79, Number 1, May 2021
- Charles Audet
, Kwassi Joseph Dzahini, Michael Kokkolaras, Sébastien Le Digabel:
Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates. 1-34 - Sander Dedoncker, Wim Desmet, Frank Naets:
Generating set search using simplex gradients for bound-constrained black-box optimization. 35-65 - Haodong Yu, Jie Sun, Yanjun Wang:
A time-consistent Benders decomposition method for multistage distributionally robust stochastic optimization with a scenario tree structure. 67-99 - Laurentiu Leustean, Pedro Pinto:
Quantitative results on a Halpern-type proximal point algorithm. 101-125 - Shummin Nakayama, Yasushi Narushima, Hiroshi Yabe:
Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions. 127-154 - David Ek, Anders Forsgren:
Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization. 155-191 - Sven Leyffer, Paul Manns, Malte Winckler:
Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation. 193-221 - Noam Goldberg, Steffen Rebennack, Youngdae Kim, Vitaliy Krasko, Sven Leyffer:
MINLP formulations for continuous piecewise linear function fitting. 223-233
Volume 79, Number 2, June 2021
- Qian Zhang, Xinyuan Zhao, Chao Ding:
Matrix optimization based Euclidean embedding with outliers. 235-271 - April Sagan, John E. Mitchell:
Low-rank factorization for rank minimization with nonconvex regularizers. 273-300 - Jean Bigeon, Sébastien Le Digabel, Ludovic Salomon:
DMulti-MADS: mesh adaptive direct multisearch for bound-constrained blackbox multiobjective optimization. 301-338 - David Kozak, Stephen Becker, Alireza Doostan, Luis Tenorio:
A stochastic subspace approach to gradient-free optimization in high dimensions. 339-368 - Majid Jahani, Naga Venkata C. Gudapati, Chenxin Ma, Rachael Tappenden, Martin Takác:
Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences. 369-404 - Filip Hanzely, Peter Richtárik, Lin Xiao:
Accelerated Bregman proximal gradient methods for relatively smooth convex optimization. 405-440 - Vincenzo Bonifaci:
A Laplacian approach to ℓ 1-norm minimization. 441-469 - Rujun Jiang, Man-Chung Yue, Zhishuo Zhou:
An accelerated first-order method with complexity analysis for solving cubic regularization subproblems. 471-506 - Reza Arefidamghani, Roger Behling, José Yunier Bello Cruz, Alfredo N. Iusem, Luiz-Rafael Santos:
The circumcentered-reflection method achieves better rates than alternating projections. 507-530
Volume 79, Number 3, July 2021
- Rui Wang, Naihua Xiu, Kim-Chuan Toh:
Subspace quadratic regularization method for group sparse multinomial logistic regression. 531-559 - Giampaolo Liuzzi, Marco Locatelli, Veronica Piccialli, Stefan Rass:
Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems. 561-599 - F. J. Hwang, Yao-Huei Huang:
An effective logarithmic formulation for piecewise linearization requiring no inequality constraint. 601-631 - Roberto Andreani, Ellen Hidemi Fukuda, Gabriel Haeser, Daiana O. Santos, Leonardo D. Secchin:
On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming. 633-648 - Jiaming Liang, Renato D. C. Monteiro, Chee-Khian Sim:
A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems. 649-679 - Masoud Ahookhosh, Le Thi Khanh Hien, Nicolas Gillis, Panagiotis Patrinos:
Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization. 681-715 - Filip Hanzely, Peter Richtárik:
Fastest rates for stochastic mirror descent methods. 717-766 - Marta Cavaleiro, Farid Alizadeh:
A dual simplex-type algorithm for the smallest enclosing ball of balls. 767-787 - David Ek, Anders Forsgren:
Exact linesearch limited-memory quasi-Newton methods for minimizing a quadratic function. 789-816
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-09 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
