default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 80
Volume 80, Number 1, September 2021
- Enrico Civitelli
, Matteo Lapucci, Fabio Schoen, Alessio Sortino:
An effective procedure for feature subset selection in logistic regression based on information criteria. 1-32 - Giulio Galvan, Marco Sciandrone, Stefano Lucidi:
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints. 33-53 - Johannes J. Brust, Zichao (Wendy) Di, Sven Leyffer, Cosmin G. Petra:
Compact representations of structured BFGS matrices. 55-88 - Xiaodong Ding, Hezhi Luo, Huixian Wu, Jianzhen Liu:
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation. 89-120 - Ion Necoara, Angelia Nedic:
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities. 121-152 - Shen Peng, Jie Jiang:
Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches. 153-184 - Christian Kanzow, Andreas B. Raharja, Alexandra Schwartz:
Sequential optimality conditions for cardinality-constrained optimization problems with applications. 185-211 - Jingyong Tang, Jinchuan Zhou:
Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem. 213-244 - R. Díaz Millán, Orizon P. Ferreira, Leandro da Fonseca Prudente:
Alternating conditional gradient method for convex feasibility problems. 245-269 - Mariano Mateos:
Sparse Dirichlet optimal control problems. 271-300 - David Frenzel, Jens Lang:
A third-order weighted essentially non-oscillatory scheme in optimal control problems governed by nonlinear hyperbolic conservation laws. 301-320
Volume 80, Number 2, November 2021
- Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher:
Forward-reflected-backward method with variance reduction. 321-346 - Timotej Hrga, Janez Povh:
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM. 347-375 - John Pavlik, Edward C. Sewell, Sheldon H. Jacobson:
Two new bidirectional search algorithms. 377-409 - Adil M. Bagirov, Najmeh Hoseini Monjezi, Sona Taheri:
An augmented subgradient method for minimizing nonsmooth DC functions. 411-438 - Feng Guo, Liguo Jiao:
On solving a class of fractional semi-infinite polynomial programming problems. 439-481 - Jie Wang, Victor Magron:
Exploiting term sparsity in noncommutative polynomial optimization. 483-521 - Faizan Ahmed, Georg Still:
Two methods for the maximization of homogeneous polynomials over the simplex. 523-548 - Francisco J. Aragón Artacho, Rubén Campoy, Matthew K. Tam:
Strengthened splitting methods for computing resolvents. 549-585 - Andreas Fischer, Alexey F. Izmailov, Mario Jelitte:
Newton-type methods near critical solutions of piecewise smooth nonlinear equations. 587-615 - Zhizhi Li, Huai Zhang, Le Ou-Yang:
The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems. 617-638 - Carolin Natemeyer, Daniel Wachsmuth:
A proximal gradient method for control problems with non-smooth and non-convex control cost. 639-677 - Christian Kanzow, Theresa Lechner:
Correction to: Globalized inexact proximal Newton-type methods for nonconvex composite functions. 679-680
Volume 80, Number 3, December 2021
- COAP 2020 best paper prize. 681-685
- Thuener Silva, Davi Michel Valladão, Tito Homem-de-Mello:
A data-driven approach for a class of stochastic dynamic optimization problems. 687-729 - Vyacheslav Kungurtsev, Francesco Rinaldi:
A zeroth order method for stochastic weakly convex optimization. 731-753 - Jan Vlcek, Ladislav Luksan:
Two limited-memory optimization methods with minimum violation of the previous secant conditions. 755-780 - Run Chen, Andrew L. Liu:
A distributed algorithm for high-dimension convex quadratically constrained quadratic programs. 781-830 - Shengjie Xu, Bingsheng He:
A parallel splitting ALM-based algorithm for separable convex programming. 831-851 - Hongxin Zhao, Lingchen Kong, Hou-Duo Qi:
Optimal portfolio selections via ℓ 1, 2-norm regularization. 853-881 - Chen Ling, Gaohang Yu, Liqun Qi, Yanwei Xu:
T-product factorization method for internet traffic data completion with spatio-temporal regularization. 883-913 - Sheng-Long Hu, Guoyin Li:
B-subdifferentials of the projection onto the matrix simplex. 915-941 - Alexey F. Izmailov:
Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers. 943-978 - Sergio González Andrade, Sofía López-Ordóñez, Pedro Merino:
Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids. 979-1025
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 2025-01-10 18:21 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:
