default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 70
Volume 70, Number 1, May 2018
- Jiawang Nie, Xinzhen Zhang:
Real eigenvalues of nonsymmetric tensors. 1-32 - Guanglin Xu, Samuel Burer:
A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. 33-59 - Federico Cabassi, Luca Consolini, Marco Locatelli:
Time-optimal velocity planning by a bound-tightening technique. 61-90 - Yangyang Xu, Shuzhong Zhang:
Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization. 91-128 - Jianchao Bai
, Jicheng Li, Fengmin Xu, Hongchao Zhang:
Generalized symmetric ADMM for separable convex optimization. 129-170 - Weizhe Gu, Wei-Po Chen, Chun-Hsu Ko, Yuh-Jye Lee, Jein-Shan Chen:
Two smooth support vector machines for \(\varepsilon \) -insensitive regression. 171-199 - Xianchao Xiu, Lingchen Kong, Yan Li, Houduo Qi:
Iterative reweighted methods for \(\ell _1-\ell _p\) minimization. 201-219 - Jakob Preininger, P. T. Vuong:
On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions. 221-238 - Eduardo Casas, Mariano Mateos, Arnd Rösch:
Improved approximation rates for a parabolic control problem with an objective promoting directional sparsity. 239-266 - Martin Gugat, Günter Leugering, Alexander Martin, Martin Schmidt, Mathias Sirvent, David Wintergerst:
MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems. 267-294 - Nikolaus von Daniels:
Tikhonov regularization of control-constrained optimal control problems. 295-320
Volume 70, Number 2, June 2018
- Bethany Nicholson, Wei Wan, Shivakumar Kameswaran, Lorenz T. Biegler:
Parallel cyclic reduction strategies for linear systems that arise in dynamic optimization problems. 321-350 - Kimon Fountoulakis, Rachael Tappenden:
A flexible coordinate descent method. 351-394 - Hao Jiang, Daniel P. Robinson, René Vidal, Chong You:
A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis. 395-418 - Anwa Zhou, Jinyan Fan:
Completely positive tensor recovery with minimal nuclear value. 419-441 - Christoph Brauer, Dirk A. Lorenz, Andreas M. Tillmann:
A primal-dual homotopy algorithm for \(\ell _{1}\) -minimization with \(\ell _{\infty }\) -constraints. 443-478 - Jianqiang Cheng, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Cosmin Safta, Jean-Paul Watson:
Chance-constrained economic dispatch with renewable energy and storage. 479-502 - Martin Branda, Max Bucher, Michal Cervinka, Alexandra Schwartz:
Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization. 503-530 - Andreas Rademacher, Korinna Rosin:
Adaptive optimal control of Signorini's problem. 531-569 - Mei-Jia Yang, Yong Xia, Jiulin Wang, Jiming Peng:
Efficiently solving total least squares with Tikhonov identical regularization. 571-592 - Tasnuva Haque, Yves Lucet:
A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions. 593-613 - Gabriel Haeser:
A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms. 615-639
Volume 70, Number 3, July 2018
- Christoph Buchheim, Renke Kuhlmann, Christian Meyer:
Combinatorial optimal control of semilinear elliptic PDEs. 641-675 - Eduardo Casas, Christopher Ryll, Fredi Tröltzsch:
Optimal control of a class of reaction-diffusion systems. 677-707 - Dimitri P. Bertsekas:
Proximal algorithms and temporal difference methods for solving fixed point problems. 709-736 - Aviv Gibali, Karl-Heinz Küfer, Daniel Reem, Philipp Süss:
A generalized projection-based scheme for solving convex constrained optimization problems. 737-762 - Renato D. C. Monteiro, Chee-Khian Sim:
Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators. 763-790 - Bingsheng He, Xiaoming Yuan:
A class of ADMM-based algorithms for three-block separable convex programming. 791-826 - Min Tao, Xiaoming Yuan:
The generalized proximal point algorithm with step size 2 is not necessarily convergent. 827-839 - Nguyen Hieu Thao:
A convergent relaxation of the Douglas-Rachford algorithm. 841-863 - Laureano F. Escudero, María Araceli Garín, Celeste Pizarro, Aitziber Unzueta:
On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems. 865-888 - Ewa M. Bednarczuk, Janusz Miroforidis, Przemyslaw Pyzel:
A multi-criteria approach to approximate solution of multiple-choice knapsack problem. 889-910
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-03-01 15:02 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:
