default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 75
Volume 75, Number 1, January 2020
- Martin Glanzer
, Georg Ch. Pflug:
Multiscale stochastic optimization: modeling aspects and scenario generation. 1-34 - Tao Sun, Yuejiao Sun, Yangyang Xu, Wotao Yin:
Markov chain block coordinate descent. 35-61 - Olivier Fercoq, Zheng Qu:
Restarting the accelerated coordinate descent method with a rough strong convexity estimate. 63-91 - Rodolfo G. Begiato, Ana Luísa Custódio, Márcia A. Gomes-Ruggiero:
A global hybrid derivative-free method for high-dimensional systems of nonlinear equations. 93-112 - Leonardo Galli, Alessandro Galligari, Marco Sciandrone:
A unified convergence framework for nonmonotone inexact decomposition methods. 113-144 - Zexian Liu, Hongwei Liu, Yu-Hong Dai:
An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization. 145-167 - Carmo P. Brás, José Mario Martínez, Marcos Raydan:
Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization. 169-205 - Pin-Bo Chen, Peng Zhang, Xide Zhu, Gui-Hua Lin:
Modified Jacobian smoothing method for nonsmooth complementarity problems. 207-235 - Weijie Cong, Le Wang, Hui Sun:
Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem. 237-262 - Glaydston de Carvalho Bento, Sandro Dimy Barbosa Bitar, João Xavier da Cruz Neto, Antoine Soubeyran, João Carlos de Oliveira Souza:
A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems. 263-290 - Hanane Krim, Rachid Benmansour, David Duvivier, Daoud Aït-Kadi, Saïd Hanafi:
Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance. 291-320
Volume 75, Number 2, March 2020
- Enrico Bettiol, Lucas Létocart, Francesco Rinaldi, Emiliano Traversi:
A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs. 321-360 - Bingsheng He, Feng Ma, Xiaoming Yuan:
Optimally linearizing the alternating direction method of multipliers for convex programming. 361-388 - Maicon Marques Alves, Jonathan Eckstein, Marina Geremia, Jefferson G. Melo:
Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms. 389-422 - Jun Yang, Hongwei Liu:
A self-adaptive method for pseudomonotone equilibrium problems and variational inequalities. 423-440 - Nicolas Boutet, Rob Haelterman, Joris Degroote:
Secant update version of quasi-Newton PSB with weighted multisecant equations. 441-466 - Qi Zhao, Zhongwen Chen:
A line search exact penalty method for nonlinear semidefinite programming. 467-491 - Ken Kobayashi, Yuichi Takano:
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems. 493-513 - Dominique Monnet, Warren L. Hare, Yves Lucet:
Fast feasibility check of the multi-material vertical alignment problem in road design. 515-536 - Nazli Dolu, Umur Hastürk, Mustafa Kemal Tural:
Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances. 537-560 - Islame F. C. Fernandes, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia, Marco César Goldbarg:
Empirical study of exact algorithms for the multi-objective spanning tree. 561-605
Volume 75, Number 3, April 2020
- Jiawang Nie:
Preface to the special issue on optimization with polynomials and tensors. 607-608 - Bilian Chen, Zhening Li:
On the tensor spectral p-norm and its dual norm via partitions. 609-628 - Lulu Cheng, Xinzhen Zhang:
A semidefinite relaxation method for second-order cone polynomial complementarity problems. 629-647 - Shouqiang Du, Maolin Che, Yimin Wei:
Stochastic structured tensors to stochastic complementarity problems. 649-668 - Feng Guo, Xiaoxia Sun:
On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems. 669-699 - Shenglong Hu:
An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors. 701-737 - Xiao Wang, Xinzhen Zhang, Guangming Zhou:
SDP relaxation algorithms for $\mathbf {P}(\mathbf {P}_0)$-tensor detection. 739-752 - Xuezhong Wang, Maolin Che, Yimin Wei:
Tensor neural network models for tensor singular value decompositions. 753-777 - Mengshi Zhang, Guyan Ni, Guofeng Zhang:
Iterative methods for computing U-eigenvalues of non-symmetric complex tensors with application in quantum entanglement. 779-798 - Ruixue Zhao, Jinyan Fan:
Higher-degree tensor eigenvalue complementarity problems. 799-816 - Guangming Zhou, Qin Wang, Wenjie Zhao:
Saddle points of rational functions. 817-832
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-05-28 20:21 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:
