default search action
Computational 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
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
Convex approximations of two-stage risk-averse mixed-integer recourse models. 313-347 - Matheus Bernardelli de Moraes
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
Volume 88, Number 2, June 2024
- Matt Menickelly
Stochastic average model methods. 405-442 - Bin Gao
Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition. 443-468 - Youssef Diouane
Inexact direct-search methods for bilevel optimization problems. 469-490 - Xiaojing Zhu
Practical gradient and conjugate gradient methods on flag manifolds. 491-524 - Silvia Bonettini
A new proximal heavy ball inexact line-search algorithm. 525-565 - Christoph Hansknecht
Convergence of successive linear programming algorithms for noisy functions. 567-601 - Ruyu Liu, Shaohua Pan, Yuqia Wu
An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization. 603-641 - Einosuke Iida
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
Volume 88, Number 3, July 2024
- Leandro da Fonseca Prudente
Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems. 719-757 - Douglas Soares Gonçalves
An away-step Frank-Wolfe algorithm for constrained multiobjective optimization. 759-781 - Orizon P. Ferreira
A boosted DC algorithm for non-differentiable DC components with non-monotone line search. 783-818 - Yassine Laguel
Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective. 819-847 - Hong Zhu
A hybrid inexact regularized Newton and negative curvature method. 849-870 - Najmeh Hoseini Monjezi, S. Nobakhtian, M. R. Pouryayevali
Nonsmooth nonconvex optimization on Riemannian manifolds via bundle trust region algorithm. 871-902 - Kun Liu, Anwa Zhou, Jinyan Fan:
A generalized alternating direction method of multipliers for tensor complementarity problems. 903-921 - Zihao Wang, Minru Bai
An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints. 923-962 - Matthias Schuster
Shape optimization for interface identification in nonlocal models. 963-997 - Robert Mansel Gower
Correction: A Bregman-Kaczmarz method for nonlinear systems of equations. 999-1000
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-03 23:17 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: