Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 88
Volume 88, Number 1, May 2024
- Rui-Jin Zhang, Xin-Wei Liu, Yu-Hong Dai:
IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming. 1-36 - Philip E. Gill, Minxin Zhang:
A projected-search interior-point method for nonlinearly constrained optimization. 37-70 - Pourya Behmandpoor
, Puya Latafat, Andreas Themelis, Marc Moonen, Panagiotis Patrinos:
SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization. 71-106 - Flávia Chorobura, Ion Necoara:
Coordinate descent methods beyond smoothness and separability. 107-149 - Bennet Gebken:
A note on the convergence of deterministic gradient sampling in nonsmooth optimization. 151-165 - Paul-Emile Maingé, André Weng-Law:
Accelerated forward-backward algorithms for structured monotone inclusions. 167-215 - Qingjie Hu, Liping Zhu, Yu Chen:
Alternative extension of the Hager-Zhang conjugate gradient method for vector optimization. 217-250 - David Esteban Bernal Neira, Ignacio E. Grossmann:
Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones. 251-312 - E. Ruben van Beesten, Ward Romeijnders, Kees Jan Roodbergen:
Convex approximations of two-stage risk-averse mixed-integer recourse models. 313-347 - Matheus Bernardelli de Moraes, Guilherme Palermo Coelho:
A benchmark generator for scenario-based discrete optimization. 349-378 - Paul R. Arbic II, Vladislav Bukshtynov:
Efficient gradient-based optimization for reconstructing binary images in applications to electrical impedance tomography. 379-403 - E. Ruben van Beesten, Ward Romeijnders, Kees Jan Roodbergen:
Convex approximations of two-stage risk-averse mixed-integer recourse models. 313-347
Volume 88, Number 2, June 2024
- Matt Menickelly, Stefan M. Wild:
Stochastic average model methods. 405-442 - Bin Gao, Renfeng Peng, Ya-xiang Yuan:
Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition. 443-468 - Youssef Diouane, Vyacheslav Kungurtsev, Francesco Rinaldi, Damiano Zeffiro:
Inexact direct-search methods for bilevel optimization problems. 469-490 - Xiaojing Zhu, Chungen Shen:
Practical gradient and conjugate gradient methods on flag manifolds. 491-524 - Silvia Bonettini, Marco Prato, Simone Rebegoldi:
A new proximal heavy ball inexact line-search algorithm. 525-565 - Christoph Hansknecht, Christian Kirches, Paul Manns:
Convergence of successive linear programming algorithms for noisy functions. 567-601 - Ruyu Liu, Shaohua Pan, Yuqia Wu, Xiaoqi Yang:
An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization. 603-641 - Einosuke Iida, Makoto Yamashita:
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems. 643-676 - Takayuki Okuno:
Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions. 677-718
a service of 
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 2024-05-23 22:10 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:
