Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 74
Volume 74, Number 1, September 2019
- Wim van Ackooij
, Welington de Oliveira, Yongjia Song:
On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems. 1-42 - Yu-Hong Dai, Yakui Huang, Xinwei Liu:
A family of spectral gradient methods for optimization. 43-65 - Dirk A. Lorenz, Quoc Tran-Dinh:
Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence. 67-92 - Jacek Gondzio, F. N. C. Sobral:
Quasi-Newton approaches to interior point methods for quadratic problems. 93-120 - Johannes Brust, Oleg Burdakov, Jennifer B. Erway, Roummel F. Marcia:
A dense initialization for limited-memory quasi-Newton methods. 121-142 - Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya, Ken Hayami:
Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning. 143-176 - Jae Hwa Lee, Yoon Mo Jung, Ya-Xiang Yuan, Sangwoon Yun:
A subspace SQP method for equality constrained optimization. 177-194 - Akram Taati, Maziar Salahi:
A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint. 195-223 - Pedro Merino:
A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs. 225-258 - Wanchun Chen, Wenhao Du, William W. Hager, Liang Yang:
Bounds for integration matrices that arise in Gauss and Radau collocation. 259-273 - William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang:
Convergence rate for a Radau hp collocation method applied to constrained optimal control. 275-314 - William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao, Xiang-Sheng Wang:
Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control. 315-316
Volume 74, Number 2, November 2019
- Hikaru Komeiji, Sunyoung Kim, Makoto Yamashita:
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems. 317-344 - Lori Badea:
Additive and restricted additive Schwarz-Richardson methods for inequalities with nonlinear monotone operators. 345-385 - Andreas M. Tillmann:
Computing the spark: mixed-integer programming for the (vector) matroid girth problem. 387-441 - Najmeh Hoseini Monjezi, S. Nobakhtian:
A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization. 443-480 - Jingqun Li, Ratnasingham Tharmarasa, Daly Brown, Thia Kirubarajan, Krishna R. Pattipati:
A novel convex dual approach to three-dimensional assignment problem: theoretical analysis. 481-516 - Ron Teller, Moshe Zofi, Moshe Kaspi:
Minimizing the average searching time for an object within a graph. 517-545 - Jifeng Bao, Carisa Kwok Wai Yu, Jinhua Wang, Yaohua Hu, Jen-Chih Yao:
Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems. 547-582 - Chee-Khian Sim:
Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence. 583-621
Volume 74, Number 3, December 2019
- COAP 2018 Best Paper Prize. 623-626
- Enzo Busseti, Walaa M. Moursi, Stephen P. Boyd:
Solution refinement at regular points of conic problems. 627-643 - Árpád Bürmen, Iztok Fajfar:
Mesh adaptive direct search with simplicial Hessian update. 645-667 - Johannes Brust, Roummel F. Marcia, Cosmin G. Petra:
Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints. 669-701 - Dusan Jakovetic, Natasa Krejic, Natasa Krklec Jerinkic:
Exact spectral-like gradient method for distributed optimization. 703-728 - Harry Fernando Oviedo Leon:
A delayed weighted gradient method for strictly convex quadratic minimization. 729-746 - Ernest K. Ryu, Yanli Liu, Wotao Yin:
Douglas-Rachford splitting and ADMM for pathological convex optimization. 747-778 - Aswin Kannan, Uday V. Shanbhag:
Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants. 779-820 - Xiaolong Qin, Nguyen Thai An:
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets. 821-850 - Paola Festa, Francesca Guerriero, Antonio Napoletano:
An auction-based approach for the re-optimization shortest path tree problem. 851-893 - Norberto Castillo-García, Paula Hernández Hernández:
Two new integer linear programming formulations for the vertex bisection problem. 895-918 - Leonardo Di Gangi, Matteo Lapucci, Fabio Schoen, Alessio Sortino:
An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series. 919-948 - Zhi Wang, Kelvin Droegemeier, Luther W. White:
Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications. 949
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-26 18:22 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:
