- Henrik A. Friberg:
Projection onto the exponential cone: a univariate root-finding problem. Optim. Methods Softw. 38(3): 457-473 (2023) - Geovani Nunes Grapiglia:
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization. Optim. Methods Softw. 38(4): 781-803 (2023) - Serge Gratton, Sadok Jerad, Philippe L. Toint:
An adaptive regularization method in Banach spaces. Optim. Methods Softw. 38(6): 1163-1179 (2023) - Julia Grübel, Olivier Huber, Lukas Hümbs, Max Klimm, Martin Schmidt, Alexandra Schwartz:
Nonconvex equilibrium models for energy markets: exploiting price information to determine the existence of an equilibrium. Optim. Methods Softw. 38(1): 153-183 (2023) - Atsushi Hori, Yuya Yamakawa, Nobuo Yamashita:
Distributionally robust expected residual minimization for stochastic variational inequality problems. Optim. Methods Softw. 38(4): 756-780 (2023) - Samuel Horváth, Dmitry Kovalev, Konstantin Mishchenko, Peter Richtárik, Sebastian U. Stich:
Stochastic distributed learning with gradient quantization and double-variance reduction. Optim. Methods Softw. 38(1): 91-106 (2023) - Jia Hu, Congying Han, Tiande Guo, Tong Zhao:
On inexact stochastic splitting methods for a class of nonconvex composite optimization problems with relative error. Optim. Methods Softw. 38(1): 1-33 (2023) - Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems. Optim. Methods Softw. 38(5): 887-913 (2023) - Xianzhen Jiang, Huihui Yang, Jinbao Jian, Xiaodi Wu:
Two families of hybrid conjugate gradient methods with restart procedures and their applications. Optim. Methods Softw. 38(5): 947-974 (2023) - Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri:
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes. Optim. Methods Softw. 38(3): 591-625 (2023) - Irem Nur Keskin, Firdevs Ulus:
Outer approximation algorithms for convex vector optimization problems. Optim. Methods Softw. 38(4): 723-755 (2023) - Maryam Khoshsimaye-Bargard, Ali Ashrafi:
A descent family of the spectral Hestenes-Stiefel method by considering the quasi-Newton method. Optim. Methods Softw. 38(3): 495-509 (2023) - Jeffery Kline, Glenn Martin Fung:
Linear programming with nonparametric penalty programs and iterated thresholding. Optim. Methods Softw. 38(1): 107-127 (2023) - Alexander Y. Krylatov:
Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network. Optim. Methods Softw. 38(5): 1081-1104 (2023) - Amélie Lambert:
Using general triangle inequalities within quadratic convex reformulation method. Optim. Methods Softw. 38(3): 626-653 (2023) - Valentin Leplat, Yurii E. Nesterov, Nicolas Gillis, François Glineur:
Conic optimization-based algorithms for nonnegative matrix factorization. Optim. Methods Softw. 38(4): 837-859 (2023) - Qian Li, Wei Zhang, Guoqiang Wang, Yanqin Bai:
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection. Optim. Methods Softw. 38(2): 434-456 (2023) - Si-Tong Lu, Qingna Li:
A majorization penalty method for SVM with sparse constraint. Optim. Methods Softw. 38(3): 474-494 (2023) - Zhaosong Lu, Xiaorui Li, Shuhuang Xiang:
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization. Optim. Methods Softw. 38(2): 412-433 (2023) - Francisco Alejandro Madera-Ramírez, Joel Antonio Trejo-Sánchez, José Luis López-Martínez, Jorge Ríos-Martínez:
Crossing edge minimization in radial outerplanar layered graphs using segment paths. Optim. Methods Softw. 38(6): 1142-1162 (2023) - Mohammad Maleki, Nahidsadat Majlesinasab, Ashesh Kumar Sinha:
An efficient model for the multiple allocation hub maximal covering problem. Optim. Methods Softw. 38(5): 1009-1030 (2023) - Alireza Olama, Eduardo Camponogara, Jan Kronqvist:
Sparse convex optimization toolkit: a mixed-integer framework. Optim. Methods Softw. 38(6): 1269-1295 (2023) - Ivo F. D. Oliveira, Ricardo H. C. Takahashi:
An incremental descent method for multi-objective optimization. Optim. Methods Softw. 38(2): 312-331 (2023) - Li-Ping Pang, Ming-Kun Zhang, Xiantao Xiao:
A stochastic approximation method for convex programming with many semidefinite constraints. Optim. Methods Softw. 38(1): 34-58 (2023) - Mauro Passacantando, Fabio Raciti:
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies. Optim. Methods Softw. 38(6): 1105-1128 (2023) - Mercedes Pelegrín, Claudia D'Ambrosio, Rémi Delmas, Youssef Hamadi:
Urban air mobility: from complex tactical conflict resolution to network design and fairness insights. Optim. Methods Softw. 38(6): 1311-1343 (2023) - Javier Peña, Negar Soheili:
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems. Optim. Methods Softw. 38(1): 218-241 (2023) - Cosmin G. Petra, Miguel A. Salazar de Troya, Noemi Petra, Youngsoo Choi, Geoffrey M. Oxberry, Daniel A. Tortorelli:
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations. Optim. Methods Softw. 38(1): 59-90 (2023) - Marc E. Pfetsch, Andreas Schmitt:
A generic optimization framework for resilient systems. Optim. Methods Softw. 38(2): 356-385 (2023) - Shaked Regev, Naiyuan Chiang, Eric Darve, Cosmin G. Petra, Michael A. Saunders, Kasia Swirydowicz, Slaven Peles:
HyKKT: a hybrid direct-iterative method for solving KKT linear systems. Optim. Methods Softw. 38(2): 332-355 (2023)