default search action
Optimization Methods and Software, Volume 39
Volume 39, Number 1, 2024
- Giancarlo Bigi, Sonia Cafieri, Nicolas Couëllan, Sophie Jan, Frédéric Messine:
Foreword. 1-3 - Gwenaël Samain
, Sébastien Bourguignon
Techniques for accelerating branch-and-bound algorithms dedicated to sparse optimization. 4-41 - Artem Agafonov, Dmitry Kamzolov
Inexact tensor methods and their application to stochastic convex optimization. 42-83 - Manlio Gaudioso
Dual formulation of the sparsity constrained optimization problem: application to classification. 84-101 - Oumaima Benchettou
Tensorial total variation-based image and video restoration with optimized projection methods. 102-133 - Yining Gu, Yanjun Wang:
Distributionally robust joint chance-constrained programming with Wasserstein metric. 134-168 - Robert Nieuwenhuis
IntSat: integer linear programming by conflict-driven constraint learning. 169-196 - Chinedu Izuchukwu, Yekini Shehu:
A new inertial projected reflected gradient method with application to optimal control problems. 197-226 - Bardhyl Miftari, Mathias Berger, Guillaume Derval, Quentin Louveaux, Damien Ernst:
GBOML: a structure-exploiting optimization modelling language in Python. 227-256
Volume 39, Number 2, 2024
- Y. N. Jiang, X. J. Cai, D. R. Han, J. F. Yang:
Customized Douglas-Rachford splitting methods for structured inverse variational inequality problems. 257-281 - Evgeny Bobrov
Study on precoding optimization algorithms in massive MIMO system with multi-antenna users. 282-297 - Matteo Salani, Saverio Basso, Vincenzo Giuffrida
PathWyse: a flexible, open-source library for the resource constrained shortest path problem. 298-320 - Xiao-Wen Chang, Tianchi Ma:
An ADMM based method for underdetermined box-constrained integer least squares problems. 321-344 - Gulcin Dinc Yalcin
Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem. 345-367 - Lam Quoc Anh, Tran Ngoc Tam:
The use of a family of Gerstewitz scalarization functions in the context of vector optimization with variable domination structures to derive scalarization results. 368-383 - Daniela Lupu, Ion Necoara:
Convergence analysis of stochastic higher-order majorization-minimization algorithms. 384-413 - Cuixia Li, Shiliang Wu:
A two-step new modulus-based matrix splitting method for vertical linear complementarity problem. 414-430 - Qiao-Li Dong, Min Su, Yekini Shehu:
Three-operator reflected forward-backward splitting algorithm with double inertial effects. 431-456
Volume 39, Number 3, 2024
- Serge Gratton, Philippe L. Toint, Jacek Gondzio, Yurii E. Nesterov
Preface for the special edition of optimization methods and software. 457-458 - Michael W. Ferry, Philip E. Gill, Elizabeth Wong, Minxin Zhang:
A class of projected-search methods for bound-constrained optimization. 459-488 - Meixia Lin, Yancheng Yuan, Defeng Sun, Kim-Chuan Toh:
A highly efficient algorithm for solving exclusive lasso problems. 489-518 - Jean-Baptiste Hiriart-Urruty:
More on second-order properties of the Moreau regularization-approximation of a convex function. 519-533 - Ana Luísa Custódio, Evelin H. M. Krulikovski, Marcos Raydan:
A hybrid direct search and projected simplex gradient method for convex constrained minimization. 534-568 - Yangjing Zhang
Learning graph Laplacian with MCP. 569-600 - Serena Crisci, Simone Rebegoldi, Gerardo Toraldo, Marco Viola:
Barzilai-Borwein-like rules in proximal gradient schemes for ℓ 1 -regularized problems. 601-633 - Vincent Acary
Second-order cone programming for frictional contact mechanics using interior point algorithm. 634-663 - Guillaume Van Dessel, François Glineur:
Optimal inexactness schedules for tunable oracle-based methods. 664-698
Volume 39, Number 4, 2024
- Melinda Hagedorn, Florian Jarre:
Optimized convergence of stochastic gradient descent by weighted averaging. 699-724 - Mohammadhossein Mohammadisiahroudi
Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments. 725-755 - Tommaso Giovannelli, Griffin D. Kent, Luís Nunes Vicente:
Bilevel optimization with a multi-objective lower-level problem: risk-neutral and risk-averse formulations. 756-778 - Michael Ulbrich, Julia Fritz:
On generalized Nash equilibrium problems in infinite-dimensional spaces using Nikaido-Isoda type functionals. 779-809 - Yutong Dai
A proximal-gradient method for problems with overlapping group-sparse regularization: support identification complexity. 810-844 - Frank E. Curtis
Derivative-free bound-constrained optimization for solving structured problems with surrogate models. 845-873 - François Pacaud, Michel Schanen, Sungho Shin, Daniel Adrian Maldonado, Mihai Anitescu
Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures. 874-897 - Tom M. Ragonneau
An optimal interpolation set for model-based derivative-free optimization methods. 898-910 - Franz Bethke
A semismooth conjugate gradients method - theoretical analysis. 911-935
Volume 39, Number 5, 2024
- Stefania Bellavia
An investigation of stochastic trust-region based algorithms for finite-sum minimization. 937-966 - Moslem Zamani
Convergence rate analysis of the gradient descent-ascent method for convex-concave saddle-point problems. 967-989 - Johannes J. Brust
Shape-changing trust-region methods using multipoint symmetric secant matrices. 990-1007 - Uledi Ngulo, Torbjörn Larsson, Nils-Hassan Quttineh
A meta-heuristic extension of the Lagrangian heuristic framework. 1008-1039 - Takashi Tsuchiya, Bruno F. Lourenço, Masakazu Muramatsu, Takayuki Okuno:
Closing duality gaps of SDPs completely through perturbation when singularity degree is one. 1040-1067 - Pavel E. Dvurechensky
Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal-dual tensor methods. 1068-1103 - Kai Pfeiffer, Abderrahmane Kheddar:
Sequential hierarchical least-squares programming for prioritized non-linear optimal control. 1104-1142 - Natasa Krklec Jerinkic, Tijana Ostojic:
AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems. 1143-1167 - Milan Hladík
Linear programming sensitivity measured by the optimal value worst-case analysis. 1168-1184
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-01 00:15 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: