• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 32 matches

• 2020
• 
  Vando A. Adona, Max L. N. Gonçalves, Jefferson G. Melo:
  An inexact proximal generalized alternating direction method of multipliers. Comput. Optim. Appl. 76(3): 621-647 (2020)
• 
  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. Comput. Optim. Appl. 76(3): 649-673 (2020)
• 
  Roger Behling, José Yunier Bello Cruz, Luiz-Rafael Santos:
  The block-wise circumcentered-reflection method. Comput. Optim. Appl. 76(3): 675-699 (2020)
• 
  Stefania Bellavia, Natasa Krejic, Benedetta Morini:
  Inexact restoration with subsampled trust-region methods for finite-sum minimization. Comput. Optim. Appl. 76(3): 701-736 (2020)
• 
  Pooriya Beyhaghi, Ryan Alimo, Thomas Bewley:
  A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging. Comput. Optim. Appl. 76(1): 1-31 (2020)
• 
  Ernesto G. Birgin:
  Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization. Comput. Optim. Appl. 76(3): 615-619 (2020)
• 
  Tim Breitenbach, Alfio Borzì:
  The Pontryagin maximum principle for solving Fokker-Planck optimal control problems. Comput. Optim. Appl. 76(2): 499-533 (2020)
• 
  Luis Felipe Bueno, Gabriel Haeser, Felipe Lara, Frank Navarro Rojas:
  An Augmented Lagrangian method for quasi-equilibrium problems. Comput. Optim. Appl. 76(3): 737-766 (2020)
• 
  Luis Felipe Bueno, Gabriel Haeser, Luiz-Rafael Santos:
  Towards an efficient augmented Lagrangian method for convex quadratic programming. Comput. Optim. Appl. 76(3): 767-800 (2020)
• 
  Zhongwen Chen, Yu-Hong Dai, Jiangyan Liu:
  A penalty-free method with superlinear convergence for equality constrained optimization. Comput. Optim. Appl. 76(3): 801-833 (2020)
• 
  Luca Consolini, Marco Locatelli, Jiulin Wang, Yong Xia:
  Efficient local search procedures for quadratic fractional programming problems. Comput. Optim. Appl. 76(1): 201-232 (2020)
• 
  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. Comput. Optim. Appl. 76(3): 835-866 (2020)
• 
  Juliano B. Francisco, Douglas Soares Gonçalves, Fermín S. V. Bazán, Lila L. T. Paredes:
  Non-monotone inexact restoration method for nonlinear programming. Comput. Optim. Appl. 76(3): 867-888 (2020)
• 
  Kevin C. Furman, Nicolas W. Sawaya, Ignacio E. Grossmann:
  A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function. Comput. Optim. Appl. 76(2): 589-614 (2020)
• 
  Max L. N. Gonçalves, Leandro da Fonseca Prudente:
  On the extension of the Hager-Zhang conjugate gradient method for vector optimization. Comput. Optim. Appl. 76(3): 889-916 (2020)
• 
  Serge Gratton, Philippe L. Toint:
  A note on solving nonlinear optimization problems in variable precision. Comput. Optim. Appl. 76(3): 917-933 (2020)
• 
  Jie Jiang, Xiaojun Chen, Zhiping Chen:
  Quantitative analysis for a class of two-stage stochastic linear variational inequality problems. Comput. Optim. Appl. 76(2): 431-460 (2020)
• 
  Weiwei Kong, Jefferson G. Melo, Renato D. C. Monteiro:
  An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems. Comput. Optim. Appl. 76(2): 305-346 (2020)
• 
  Lorenzo Lampariello, Simone Sagratella:
  Numerically tractable optimistic bilevel problems. Comput. Optim. Appl. 76(2): 277-303 (2020)
• 
  Guanghui Lan, Zhiqiang Zhou:
  Algorithms for stochastic optimization with function or expectation constraints. Comput. Optim. Appl. 76(2): 461-498 (2020)
• 
  Si-Tong Lu, Miao Zhang, Qing-Na Li:
  Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints. Comput. Optim. Appl. 76(2): 535-569 (2020)
• 
  Juan Pablo Luna, Claudia A. Sagastizábal, Mikhail V. Solodov:
  A class of Benders decomposition methods for variational inequalities. Comput. Optim. Appl. 76(3): 935-959 (2020)
• 
  Patrick Mehlitz:
  A comparison of solution approaches for the numerical treatment of or-constrained optimization problems. Comput. Optim. Appl. 76(1): 233-275 (2020)
• 
  Takashi Nakagaki, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita:
  A dual spectral projected gradient method for log-determinant semidefinite problems. Comput. Optim. Appl. 76(1): 33-68 (2020)
• 
  Dominique Orban, Abel Soares Siqueira:
  A regularization method for constrained nonlinear least squares. Comput. Optim. Appl. 76(3): 961-989 (2020)
• 
  Li-Ping Pang, Qi Wu, Jin-He Wang, Qiong Wu:
  A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods. Comput. Optim. Appl. 76(1): 125-153 (2020)
• 
  Julian Rasch, Antonin Chambolle:
  Inexact first-order primal-dual algorithms. Comput. Optim. Appl. 76(2): 381-430 (2020)
• 
  Mauricio Romero Sicre:
  On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems. Comput. Optim. Appl. 76(3): 991-1019 (2020)
• 
  Tianxiao Sun, Ion Necoara, Quoc Tran-Dinh:
  Composite convex optimization with global and local inexact oracles. Comput. Optim. Appl. 76(1): 69-124 (2020)
• 
  Hoi-To Wai, Wei Shi, César A. Uribe, Angelia Nedic, Anna Scaglione:
  Accelerating incremental gradient optimization with curvature information. Comput. Optim. Appl. 76(2): 347-380 (2020)

skipping 2 more matches