default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 82
Volume 82, Number 1, May 2022
- Xiaoyuan Liu
, Hayato Ushijima-Mwesigwa, Avradip Mandal, Sarvagya Upadhyay, Ilya Safro, Arnab Roy:
Leveraging special-purpose hardware for local search heuristics. 1-29 - Geovani Nunes Grapiglia, Gabriel F. D. Stella:
An adaptive trust-region method without function evaluations. 31-60 - Hardik Tankaria, Shinji Sugimoto, Nobuo Yamashita:
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations. 61-88 - Wenjie Zhao, Guangming Zhou:
Local saddle points for unconstrained polynomial optimization. 89-106 - Pedro R. S. Antunes, Beniamin Bogosel:
Parametric shape optimization using the support function. 107-138 - Pedro R. S. Antunes, Beniamin Bogosel:
Correction to: Parametric shape optimization using the support function. 139 - Tianxiang Liu, Akiko Takeda:
An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems. 141-173 - Qihang Lin, Runchao Ma, Yangyang Xu:
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization. 175-224 - Peter Benner, Jan Heiland, Steffen W. R. Werner:
Robust output-feedback stabilization for incompressible flows using low-dimensional ℋ∞ -controllers. 225-249 - Angelika Wiegele, Shudian Zhao:
SDP-based bounds for graph partition via extended ADMM. 251-291
Volume 82, Number 2, June 2022
- Tommaso Giovannelli, Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi:
Derivative-free methods for mixed-integer nonsmooth constrained optimization. 293-327 - Masoud Fatemi:
On initial point selection of the steepest descent algorithm for general quadratic functions. 329-360 - Guanghui Lan, Yuyuan Ouyang:
Accelerated gradient sliding for structured convex optimization. 361-394 - Andreas Themelis, Lorenzo Stella, Panagiotis Patrinos:
Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms. 395-440 - Xianfu Wang, Ziyuan Wang:
Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems. 441-463 - Bastian Pötzl, Anton Schiela, Patrick Jaap:
Second order semi-smooth Proximal Newton methods in Hilbert spaces. 465-498 - Meizhi Qian, Shengfeng Zhu:
A level set method for Laplacian eigenvalue optimization subject to geometric constraints. 499-524 - Arnaud Flori, Hamouche Oulhadj, Patrick Siarry:
QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization. 525-559
Volume 82, Number 3, July 2022
- Lam M. Nguyen, Marten van Dijk, Dzung T. Phan, Phuong Ha Nguyen, Tsui-Wei Weng, Jayant R. Kalagnanam:
Finite-sum smooth optimization with SARAH. 561-593 - Xuezhong Wang, Maolin Che, Yimin Wei:
Randomized Kaczmarz methods for tensor complementarity problems. 595-615 - Pedro Borges:
Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS. 617-647 - Maxim V. Dolgopolik:
DC Semidefinite programming and cone constrained DC optimization I: theory. 649-671 - Weiwei Kong, Renato D. C. Monteiro:
Accelerated inexact composite gradient methods for nonconvex spectral optimization problems. 673-715 - Lakmali Weerasena, Aniekan Ebiefung, Anthony Skjellum:
Design of a heuristic algorithm for the generalized multi-objective set covering problem. 717-751 - Dominik Hafemeyer, Florian Mannel:
A path-following inexact Newton method for PDE-constrained optimal control in BV. 753-794
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-05-19 22:23 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
