default search action
Computational Optimization and Applications, Volume 76
Volume 76, Number 1, May 2020
- Pooriya Beyhaghi, Ryan Alimo, Thomas Bewley:
A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging. 1-31 - Takashi Nakagaki, Mituhiro Fukuda
, Sunyoung Kim, Makoto Yamashita:
A dual spectral projected gradient method for log-determinant semidefinite problems. 33-68 - Tianxiao Sun, Ion Necoara, Quoc Tran-Dinh
Composite convex optimization with global and local inexact oracles. 69-124 - Li-Ping Pang, Qi Wu, Jin-He Wang, Qiong Wu:
A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods. 125-153 - Max Winkler
Error estimates for the finite element approximation of bilinear boundary control problems. 155-199 - Luca Consolini, Marco Locatelli
Efficient local search procedures for quadratic fractional programming problems. 201-232 - Patrick Mehlitz
A comparison of solution approaches for the numerical treatment of or-constrained optimization problems. 233-275
Volume 76, Number 2, June 2020
- Lorenzo Lampariello
Numerically tractable optimistic bilevel problems. 277-303 - Weiwei Kong
An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems. 305-346 - Hoi-To Wai, Wei Shi, César A. Uribe
Accelerating incremental gradient optimization with curvature information. 347-380 - Julian Rasch
Inexact first-order primal-dual algorithms. 381-430 - Jie Jiang
Quantitative analysis for a class of two-stage stochastic linear variational inequality problems. 431-460 - Guanghui Lan
Algorithms for stochastic optimization with function or expectation constraints. 461-498 - Tim Breitenbach, Alfio Borzì
The Pontryagin maximum principle for solving Fokker-Planck optimal control problems. 499-533 - Si-Tong Lu, Miao Zhang, Qing-Na Li
Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints. 535-569 - Yang Zhan
A differentiable path-following algorithm for computing perfect stationary points. 571-588 - Kevin C. Furman
A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function. 589-614
Volume 76, Number 3, July 2020
- Ernesto G. Birgin
Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. 615-619 - Vando A. Adona, Max L. N. Gonçalves, Jefferson G. Melo
An inexact proximal generalized alternating direction method of multipliers. 621-647 - Yldenilson Torres Almeida, João Xavier da Cruz Neto, Paulo Roberto Oliveira, João Carlos de Oliveira Souza
A modified proximal point method for DC functions on Hadamard manifolds. 649-673 - Roger Behling
The block-wise circumcentered-reflection method. 675-699 - Stefania Bellavia, Natasa Krejic
Inexact restoration with subsampled trust-region methods for finite-sum minimization. 701-736 - Luis Felipe Bueno, Gabriel Haeser, Felipe Lara
An Augmented Lagrangian method for quasi-equilibrium problems. 737-766 - Luis Felipe Bueno
Towards an efficient augmented Lagrangian method for convex quadratic programming. 767-800 - Zhongwen Chen, Yu-Hong Dai, Jiangyan Liu:
A penalty-free method with superlinear convergence for equality constrained optimization. 801-833 - Maria Aparecida Diniz Ehrhardt, Deise Gonçalves Ferreira, Sandra A. Santos
Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification. 835-866 - Juliano B. Francisco
Non-monotone inexact restoration method for nonlinear programming. 867-888 - Max L. N. Gonçalves, Leandro da Fonseca Prudente
On the extension of the Hager-Zhang conjugate gradient method for vector optimization. 889-916 - Serge Gratton, Philippe L. Toint:
A note on solving nonlinear optimization problems in variable precision. 917-933 - Juan Pablo Luna
A class of Benders decomposition methods for variational inequalities. 935-959 - Dominique Orban, Abel Soares Siqueira
A regularization method for constrained nonlinear least squares. 961-989 - Mauricio Romero Sicre
On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems. 991-1019
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-11-19 20:34 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: