default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOptimization Methods and Software, Volume 38
Volume 38, Number 1, January 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. 1-33 - Li-Ping Pang, Ming-Kun Zhang
, Xiantao Xiao:
A stochastic approximation method for convex programming with many semidefinite constraints. 34-58 - 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. 59-90 - Samuel Horváth, Dmitry Kovalev, Konstantin Mishchenko, Peter Richtárik, Sebastian U. Stich:
Stochastic distributed learning with gradient quantization and double-variance reduction. 91-106 - Jeffery Kline, Glenn Martin Fung:
Linear programming with nonparametric penalty programs and iterated thresholding. 107-127 - Yan Tang, Haiyun Zhou:
New iterative algorithms with self-adaptive step size for solving split equality fixed point problem and its applications. 128-152 - 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. 153-183 - Quoc Tran-Dinh, Deyi Liu:
A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates. 184-217 - Javier Peña, Negar Soheili:
Implementation of a projection and rescaling algorithm for second-order conic feasibility problems. 218-241
Volume 38, Number 2, March 2023
- Harsh Narayan Singh, Vivek Laha:
On minty variational principle for quasidifferentiable vector optimization problems. 243-261 - Yanyun Ding, Haibin Zhang, Peili Li, Yunhai Xiao:
An efficient semismooth Newton method for adaptive sparse signal recovery problems. 262-288 - Hao-Jun Michael Shi, Melody Qiming Xuan, Figen Öztoprak, Jorge Nocedal:
On the numerical performance of finite-difference-based methods for derivative-free optimization. 289-311 - Ivo F. D. Oliveira, Ricardo H. C. Takahashi:
An incremental descent method for multi-objective optimization. 312-331 - 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. 332-355 - Marc E. Pfetsch, Andreas Schmitt:
A generic optimization framework for resilient systems. 356-385 - Albert S. Berahas, Oumaima Sohab, Luís Nunes Vicente:
Full-low evaluation methods for derivative-free optimization. 386-411 - Zhaosong Lu, Xiaorui Li, Shuhuang Xiang:
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization. 412-433 - Qian Li, Wei Zhang, Guoqiang Wang, Yanqin Bai:
Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection. 434-456
Volume 38, Number 3, May 2023
- Henrik A. Friberg:
Projection onto the exponential cone: a univariate root-finding problem. 457-473 - Si-Tong Lu, Qingna Li:
A majorization penalty method for SVM with sparse constraint. 474-494 - Maryam Khoshsimaye-Bargard, Ali Ashrafi:
A descent family of the spectral Hestenes-Stiefel method by considering the quasi-Newton method. 495-509 - Jiefeng Xu, Dong-Hui Li, Xueli Bai:
Feasible Newton methods for symmetric tensor Z-eigenvalue problems. 510-528 - Zohre Aminifard, Saman Babaie-Kafaki:
An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions. 529-542 - Samir Adly, Mounir Haddou, Manh Hung Le:
Interior point methods for solving Pareto eigenvalue complementarity problems. 543-569 - Md Abu Talhamainuddin Ansary:
A Newton-type proximal gradient method for nonlinear multi-objective optimization problems. 570-590 - Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri:
A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes. 591-625 - Amélie Lambert:
Using general triangle inequalities within quadratic convex reformulation method. 626-653
Volume 38, Number 4, July 2023
- Kay Barshad, Aviv Gibali, Simeon Reich:
Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space. 655-667 - Maxim V. Dolgopolik:
Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints. 668-697 - Jennifer B. Erway, Mostafa Rezapour:
A new multipoint symmetric secant method with a dense initial matrix. 698-722 - Irem Nur Keskin, Firdevs Ulus:
Outer approximation algorithms for convex vector optimization problems. 723-755 - Atsushi Hori, Yuya Yamakawa, Nobuo Yamashita:
Distributionally robust expected residual minimization for stochastic variational inequality problems. 756-780 - Geovani Nunes Grapiglia:
Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization. 781-803 - Savin Treanta:
On a minimal criterion of efficiency in vector variational control problems. 804-812 - Xuyang Wu, Kin Cheong Sou, Jie Lu:
A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks. 813-836 - Valentin Leplat, Yurii E. Nesterov, Nicolas Gillis, François Glineur:
Conic optimization-based algorithms for nonnegative matrix factorization. 837-859
Volume 38, Number 5, September 2023
- Deliang Wei, Peng Chen, Fang Li, Xiangyun Zhang:
Efficient second-order optimization with predictions in differential games. 861-886 - Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems. 887-913 - Qingsong Wang, Deren Han:
A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity. 914-946 - Xianzhen Jiang, Huihui Yang, Jinbao Jian, Xiaodi Wu:
Two families of hybrid conjugate gradient methods with restart procedures and their applications. 947-974 - Thai Doan Chuong, Xinghuo Yu, Andrew C. Eberhard, Chaojie Li, Chen Liu:
Convergences for robust bilevel polynomial programmes with applications. 975-1008 - Mohammad Maleki, Nahidsadat Majlesinasab, Ashesh Kumar Sinha:
An efficient model for the multiple allocation hub maximal covering problem. 1009-1030 - Amir Beck, Raz Sharon:
A branch and bound method solving the max-min linear discriminant analysis problem. 1031-1057 - Annamaria Barbagallo, Serena Guarino Lo Bianco:
Infinite dimensional tensor variational inequalities with applications to an economic equilibrium problem. 1058-1080 - Alexander Y. Krylatov:
Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network. 1081-1104
Volume 38, Number 6, November 2023
- Mauro Passacantando, Fabio Raciti:
A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies. 1105-1128 - Susanne Sass, Angelos Tsoukalas, Ian H. Bell, Dominik Bongartz, Jaromil Najman, Alexander Mitsos:
Towards global parameter estimation exploiting reduced data sets. 1129-1141 - 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. 1142-1162 - Serge Gratton, Sadok Jerad, Philippe L. Toint:
An adaptive regularization method in Banach spaces. 1163-1179 - Artem Vasin, Alexander V. Gasnikov, Pavel E. Dvurechensky, Vladimir G. Spokoiny:
Accelerated gradient methods with absolute and relative noise in the gradient. 1180-1229 - Valentin Duruisseaux, Melvin Leok:
Practical perspectives on symplectic accelerated optimization. 1230-1268 - Alireza Olama, Eduardo Camponogara, Jan Kronqvist:
Sparse convex optimization toolkit: a mixed-integer framework. 1269-1295 - Yuya Yamakawa, Tetsuya Ikegami, Ellen H. Fukuda, Nobuo Yamashita:
An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs. 1296-1310 - 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. 1311-1343
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-02 01:04 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.
