default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 83
Volume 83, Number 1, September 2022
- Ernesto G. Birgin
, José Mario Martínez:
Block coordinate descent for smooth nonconvex constrained minimization. 1-27 - Charles Audet, Sébastien Le Digabel, Renaud Saltet:
Quantifying uncertainty with ensembles of surrogates for blackbox optimization. 29-66 - James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura:
Polyhedral analysis and a new algorithm for the length constrained K-drones rural postman problem. 67-109 - Amadeu Almeida Coco, Andréa Cynthia Santos, Thiago F. Noronha:
Robust min-max regret covering problems. 111-141 - Lingzi Jin, Xiao Wang:
A stochastic primal-dual method for a class of nonconvex constrained optimization. 143-180 - Monika Eisenmann, Tony Stillfjord, Måns Williamson:
Sub-linear convergence of a stochastic proximal iteration method in Hilbert space. 181-210 - Fabio Vitor, Todd Easton:
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming. 211-246 - Le Thi Khanh Hien, Duy Nhat Phan, Nicolas Gillis:
Inertial alternating direction method of multipliers for non-convex non-smooth optimization. 247-285 - Xin Qu, Wei Bian:
Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization. 287-317 - Rubén Campoy:
A product space reformulation with reduced dimension for splitting algorithms. 319-348 - Andrei Sipos:
Abstract strongly convergent variants of the proximal point algorithm. 349-380
Volume 83, Number 2, November 2022
- Ruixue Zhao, Jinyan Fan:
Levenberg-Marquardt method based on probabilistic Jacobian models for nonlinear equations. 381-401 - Max L. N. Gonçalves, Fernando S. Lima, Leandro da Fonseca Prudente:
Globally convergent Newton-type methods for multiobjective optimization. 403-434 - Marco Bernreuther, Georg Müller, Stefan Volkwein:
Efficient scalarization in multiobjective optimal control of a nonsmooth PDE. 435-464 - Shisheng Cui, Uday V. Shanbhag, Mathias Staudigl, Phan Tu Vuong:
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces. 465-524 - Inmaculada Espejo, Rafael Paz, Justo Puerto, Antonio M. Rodríguez-Chía:
Minimum cost b-matching problems with neighborhoods. 525-553 - Stefano Ardizzoni, Luca Consolini, Mattia Laurini, Marco Locatelli:
Shortest path with acceleration constraints: complexity and approximation algorithms. 555-592 - Luigi Di Puglia Pugliese, Daniele Ferone, Paola Festa, Francesca Guerriero:
A generalized shortest path tour problem with time windows. 593-614 - Huynh van Ngai, Ta Anh Son:
Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order o(1/k2). 615-649 - Hongwei Liu, Ting Wang, Zexian Liu:
Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems. 651-691 - Andrea Cristofari, Marianna De Santis, Stefano Lucidi, Francesco Rinaldi:
Minimization over the ℓ 1-ball using an active-set non-monotone projected gradient. 693-721
Volume 83, Number 3, December 2022
- Christian Kanzow, Theresa Lechner:
COAP 2021 Best Paper Prize. 723-726 - Jacek Gondzio, Spyridon Pougkakiotis, John W. Pearson:
General-purpose preconditioning for regularized interior point methods. 727-757 - Dominic Yang, Prasanna Balaprakash, Sven Leyffer:
Modeling design and control problems involving neural network surrogates. 759-800 - Xian Zhang, Dingtao Peng:
Solving constrained nonsmooth group sparse optimization via group Capped-ℓ 1 relaxation and group smoothing proximal gradient algorithm. 801-844 - Antonin Chambolle, Robert Tovey:
"FISTA" in Banach spaces with adaptive discretisations. 845-892 - Shota Takahashi, Mituhiro Fukuda, Mirai Tanaka:
New Bregman proximal type algorithms for solving DC optimization problems. 893-931 - Zhijian Lai, Akiko Yoshise:
Completely positive factorization by a Riemannian smoothing method. 933-966 - Hao Wang, Hao Zeng, Jiashan Wang:
An extrapolated iteratively reweighted ℓ 1 method with complexity analysis. 967-997 - Scott B. Lindstrom:
Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions. 999-1026 - Yuya Yamakawa, Takayuki Okuno:
A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs. 1027-1064
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-06 22:38 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.
