default search action
Computational Optimization and Applications, Volume 77
Volume 77, Number 1, September 2020
- Guido Cocchi, Giampaolo Liuzzi, Stefano Lucidi, Marco Sciandrone:
On the convergence of steepest descent methods for multiobjective optimization. 1-27 - Guido Cocchi
, Matteo Lapucci
An augmented Lagrangian algorithm for multi-objective optimization. 29-56 - Andrea Cristofari
An active-set algorithmic framework for non-convex optimization problems over the simplex. 57-89 - Min Tao
Convergence study of indefinite proximal ADMM with a relaxation factor. 91-123 - Hesam Ahmadi, Uday V. Shanbhag
On the resolution of misspecified convex optimization and monotone variational inequality problems. 125-161 - Juncai He
Make ℓ 1 regularization effective in training sparse CNN. 163-182 - Yaohua Hu, Jiawen Li, Carisa Kwok Wai Yu
Convergence rates of subgradient methods for quasi-convex optimization problems. 183-212 - Konstantin Pieper
Inverse point source location with the Helmholtz equation on a bounded domain. 213-249 - Julius Fergy T. Rabago
A second-order shape optimization algorithm for solving the exterior Bernoulli free boundary problem using a new boundary cost functional. 251-305 - Nicolas Delanoue
Nonlinear optimal control: a numerical scheme based on occupation measures and interval analysis. 307-334
Volume 77, Number 2, November 2020
- Lorenzo Lampariello
An explicit Tikhonov algorithm for nested variational inequalities. 335-350 - Gilles Bareilles, Franck Iutzeler
On the interplay between acceleration and identification for the proximal gradient algorithm. 351-378 - Morteza Maleknia
A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions. 379-409 - Yunmei Chen
Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization. 411-432 - Stefano Cipolla
A variation of Broyden class methods using Householder adaptive transforms. 433-463 - Xiangfeng Wang, Junping Zhang, Wenxing Zhang:
The distance between convex sets with Minkowski sum structure: application to collision detection. 465-490 - Hongwei Liu, Jun Yang
Weak convergence of iterative methods for solving quasimonotone variational inequalities. 491-508 - Abdesslem Boulkhemair, Abdelkrim Chakib, Abdeljalil Nachaoui
On a numerical shape optimization approach for a class of free boundary problems. 509-537 - Nicolas Kämmerling, Jannis Kurtz
Oracle-based algorithms for binary two-stage robust optimization. 539-569 - Alberto Bemporad
Global optimization via inverse distance weighting and radial basis functions. 571-595 - Siamak Akbarzadeh, Jan Hückelheim, Jens-Dominik Müller
Consistent treatment of incompletely converged iterative linear solvers in reverse-mode algorithmic differentiation. 597-616
Volume 77, Number 3, December 2020
- COAP 2019 Best Paper Prize: Paper of S. Gratton, C. W. Royer, L. N. Vicente, and Z. Zhang. 617-621
- COAP 2019 Best Paper Prize: Paper of Andreas Tillmann. 623-626
- Andrea Caliciotti
Issues on the use of a modified Bunch and Kaufman decomposition for large scale Newton's equation. 627-651 - Nicolas Loizou
Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods. 653-710 - Masao Fukushima, Joaquim Júdice
A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem. 711-728 - William W. Hager
Convergence rates for an inexact ADMM applied to separable convex optimization. 729-754 - Massimo De Mauri
A proximal-point outer approximation algorithm. 755-777 - Xiaojing Zhu
Riemannian conjugate gradient methods with inverse retraction. 779-810 - Hiroyuki Sakai
Hybrid Riemannian conjugate gradient methods with global convergence properties. 811-830 - Veronika Karl, Ira Neitzel, Daniel Wachsmuth:
A Lagrange multiplier method for semilinear elliptic state constrained optimal control problems. 831-869 - Zhenyu Ming, Liping Zhang, Liqun Qi:
Expected residual minimization method for monotone stochastic tensor complementarity problem. 871-896 - Carmo P. Brás
On the use of polynomial models in multiobjective directional direct search. 897-918
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 2024-12-15 01:16 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by: