Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 66
Volume 66, Number 1, January 2017
- Ricardo M. Lima
, Ignacio E. Grossmann:
On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study. 1-37 - Xingju Cai, Deren Han, Xiaoming Yuan:
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function. 39-73 - Dang Van Hieu, Pham Ky Anh, Le Dung Muu:
Modified hybrid projection methods for finding common solutions to variational inequality problems. 75-96 - Jing Zhou, Shu-Cherng Fang, Wenxun Xing:
Conic approximation to quadratic optimization with linear complementarity constraints. 97-122 - Sergio González Andrade:
A preconditioned descent algorithm for variational inequalities of the second kind involving the p-Laplacian operator. 123-162 - Severino F. Galán:
Simple decentralized graph coloring. 163-185 - Chao Ding, Hou-Duo Qi:
Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation. 187-218 - Kenji Ueda, Nobuo Yamashita:
Erratum to: A regularized Newton method without line search for unconstrained optimization. 219-222
Volume 66, Number 2, March 2017
- Maziar Salahi, Akram Taati, Henry Wolkowicz:
Local nonglobal minima for solving large-scale extended trust-region subproblems. 223-244 - Johannes Brust, Jennifer B. Erway, Roummel F. Marcia:
On solving L-SR1 trust-region subproblems. 245-266 - Jinyan Fan, Anwa Zhou:
A semidefinite algorithm for completely positive tensor decomposition. 267-283 - Na Zhao, Qingzhi Yang, Yajun Liu:
Computing the generalized eigenvalues of weakly symmetric tensors. 285-307 - Meijiao Liu, Yong-Jin Liu:
Fast algorithm for singly linearly constrained quadratic programs with box-like constraints. 309-326 - Liang Chen, Defeng Sun, Kim-Chuan Toh:
A note on the convergence of ADMM for linearly constrained convex optimization problems. 327-343 - Reza Eghbali, Maryam Fazel:
Decomposable norm minimization with proximal-gradient homotopy algorithm. 345-381 - Elvira Antal, Tamás Vinkó:
Modeling max-min fair bandwidth allocation in BitTorrent communities. 383-400
Volume 66, Number 3, April 2017
- Wei Wan, Lorenz T. Biegler:
Structured regularization for barrier NLP solvers. 401-424 - Quoc Tran-Dinh:
Adaptive smoothing algorithms for nonsmooth composite convex minimization. 425-451 - Naohiko Arima, Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh:
A robust Lagrangian-DNN method for a class of quadratic optimization problems. 453-479 - Huiping Cao, Dong-Hui Li:
Partitioned quasi-Newton methods for sparse nonlinear equations. 481-505 - Sanja Rapajic, Zoltán Papp:
A nonmonotone Jacobian smoothing inexact Newton method for NCP. 507-532 - K. Lakshmanan, Shalabh Bhatnagar:
Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization. 533-556 - Zheng-Hai Huang, Liqun Qi:
Formulating an n-person noncooperative game as a tensor complementarity problem. 557-576 - Ali Mohammad Nezhad, Tamás Terlaky:
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization. 577-600
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-04-25 20:49 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:
