default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 72
Volume 72, Number 1, January 2019
- Quoc Tran-Dinh
:
Proximal alternating penalty algorithms for nonsmooth constrained convex optimization. 1-43 - Daria Ghilli, Karl Kunisch:
On monotone and primal-dual active set schemes for ℓp-type problems, p ∈ (0, 1]. 45-85 - Yangyang Xu:
Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs. 87-113 - Bo Jiang, Tianyi Lin, Shiqian Ma, Shuzhong Zhang:
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis. 115-157 - Fabiana R. de Oliveira, Orizon P. Ferreira, Gilson N. Silva:
Newton's method with feasible inexact projections for solving constrained generalized equations. 159-177 - Hongsheng Liu, Shu Lu:
Convergence of the augmented decomposition algorithm. 179-213 - Alexey F. Izmailov, Mikhail V. Solodov, E. I. Uskov:
A globally convergent Levenberg-Marquardt method for equality-constrained optimization. 215-239 - Cosmin G. Petra, Florian A. Potra:
A homogeneous model for monotone mixed horizontal linear complementarity problems. 241-267 - Elif Garajová, Milan Hladík:
On the optimal solution set in interval linear programming. 269-292
Volume 72, Number 2, March 2019
- Hiroyuki Sato, Kensuke Aihara:
Cholesky QR-based retraction on the generalized Stiefel manifold. 293-308 - Christoph Neumann, Oliver Stein, Nathan Sudermann-Merx:
A feasible rounding approach for mixed-integer optimization problems. 309-337 - Hiroki Tanabe, Ellen H. Fukuda, Nobuo Yamashita:
Proximal gradient methods for multiobjective optimization and their applications. 339-361 - Baha Alzalg:
A primal-dual interior-point method based on various selections of displacement step for symmetric optimization. 363-390 - Shuai Liu:
A simple version of bundle method with linear programming. 391-412 - Francisco Benita, Patrick Mehlitz:
Solving optimal control problems with terminal complementarity constraints via Scholtes' relaxation scheme. 413-430 - Simone Göttlich, Andreas Potschka, Claus Teuber:
A partial outer convexification approach to control transmission lines. 431-456 - Stefania Corsaro, Valentina De Simone:
Adaptive l1-regularization for short-selling control in portfolio selection. 457-478 - Madani Bezoui, Mustapha Moulaï, Ahcène Bounceur, Reinhardt Euler:
An iterative method for solving a bi-objective constrained portfolio optimization problem. 479-498 - Mohsen Ahmadvand, Mohsen Esmaeilbeigi, Ahmad Kamandi, Farajollah Mohammadi Yaghoobi:
A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques. 499-524
Volume 72, Number 3, April 2019
- Serge Gratton, Clément W. Royer, Luís Nunes Vicente, Zaikun Zhang:
Direct search based on probabilistic feasible descent for bound and linearly constrained problems. 525-559 - Ian D. Coope, Rachael Tappenden:
Efficient calculation of regular simplex gradients. 561-588 - Gianpiero Canessa, Julian A. Gallego, Lewis Ntaimo, Bernardo K. Pagnoncelli:
An algorithm for binary linear chance-constrained problems using IIS. 589-608 - Ronaldo Lopes, Sandra A. Santos, Paulo J. S. Silva:
Accelerating block coordinate descent methods with identification strategies. 609-640 - Ching-pei Lee, Stephen J. Wright:
Inexact Successive quadratic approximation for regularized optimization. 641-674 - Kamer Kaya, Figen Öztoprak, S. Ilker Birbil, A. Taylan Cemgil, Umut Simsekli, Nurdan Kuru, Hazal Koptagel, M. Kaan Öztürk:
A framework for parallel second order incremental optimization algorithms for solving partially separable problems. 675-705 - Luis M. Briceño-Arias, Giovanni Chierchia, Emilie Chouzenoux, Jean-Christophe Pesquet:
A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression. 707-726 - M. Paul Laiu, André L. Tits:
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme. 727-768 - Leonid Faybusovich, Cunlu Zhou:
Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions. 769-795 - Yu Deng, Patrick Mehlitz, Uwe Prüfert:
Optimal control in first-order Sobolev spaces with inequality constraints. 797-826 - Huizhen Zhang, Cesar Beltran-Royo, Bo Wang, Ziying Zhang:
Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce. 827-848
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-04-01 23:52 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:
