default search action
Optimization Methods and Software, Volume 34
Volume 34, Number 1, 2019
- Wenwen Zhou, I. G. Akrotirianakis, Seyed Alireza Yektamaram, Joshua Griffin:
A matrix-free line-search algorithm for nonconvex optimization. 1-24 - Fatemeh Abdi, Fatemeh Shakeri:
A globally convergent BFGS method for pseudo-monotone variational inequality problems. 25-36 - Jordi Castro
, José A. González
A linear optimization-based method for data privacy in statistical tabular data. 37-61 - Didier Henrion
SPECTRA - a Maple library for solving linear matrix inequalities in exact arithmetic. 62-78 - Giampaolo Liuzzi
A new branch-and-bound algorithm for standard quadratic programming problems. 79-97 - Sourour Elloumi, Amélie Lambert:
Global solution of non-convex quadratically constrained quadratic programs. 98-114 - Lijian Chen:
A polynomial approximation-based approach for chance-constrained optimization. 115-138 - Jie Fan, Guoqing Wang:
Improved algorithms for dynamic lot sizing problems with incremental discount. 139-149 - Nitish Shirish Keskar, Andreas Wächter:
A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization. 150-171 - Amir Beck, Nili Guttmann-Beck:
FOM - a MATLAB toolbox of first-order methods for solving convex optimization problems. 172-193 - Wenbo Gao, Donald Goldfarb:
Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions. 194-217
- Jonathan W. Gillard
Deterministic global optimization: an introduction to the diagonal approach. 218-219 - Ignacio E. Grossmann:
Optimization and management in manufacturing engineering: resource collaborative optimization and management through the internet of things. 220-223
Volume 34, Number 2, 2019
- Luc Pronzato:
On the elimination of inessential points in the smallest enclosing ball problem. 225-247 - Pachara Jailoka, Suthep Suantai:
Split common fixed point and null point problems for demicontractive operators in Hilbert spaces. 248-263 - Saeed Rezaee, Saman Babaie-Kafaki:
An adaptive nonmonotone trust region algorithm. 264-277 - Kai Wang, Jitamitra Desai:
On the convergence rate of the augmented Lagrangian-based parallel splitting method. 278-304
- Ion Necoara, Andrei Patrascu
Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming. 305-335
- Soodabeh Asadi
A long-step feasible predictor-corrector interior-point algorithm for symmetric cone optimization. 336-362 - Napsu Karmitsa
Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization. 363-382 - Franck Iutzeler
A generic online acceleration scheme for optimization algorithms via relaxation and inertia. 383-405 - Veronika Grimm, Thomas Kleinert, Frauke Liers
Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches. 406-436 - Harry Oviedo
A non-monotone linear search algorithm with mixed direction on Stiefel manifold. 437-457
Volume 34, Number 3, 2019
- Oleg V. Khamisov, Gerhard-Wilhelm Weber:
Advances in optimization theory and applications (Baikal 2017, ICCESEN 2016 and 2017). 459-461
- Adil M. Bagirov
A sharp augmented Lagrangian-based method in constrained non-convex optimization. 462-488 - Radu Ioan Bot
Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces. 489-514 - Karima Boufi, Ahmed Roubi:
Prox-regularization of the dual method of centers for generalized fractional programs. 515-545 - Xiao-Liang Dong, Zexian Liu, Hong-Wei Liu, Xiang-Li Li:
An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method. 546-559 - Sergey Guminov
A universal modification of the linear coupling method. 560-577 - S. I. Kolesnikova:
A multiple-control system for nonlinear discrete object under uncertainty. 578-585 - Erik Kropat
Computational networks and systems - homogenization of variational problems on micro-architectured networks and devices. 586-611 - Qian Li, Yanqin Bai, Xin Yan, Wei Zhang
Portfolio selection with the effect of systematic risk diversification: formulation and accelerated gradient algorithm. 612-633 - María de los Ángeles Martínez, Damián R. Fernández
A quasi-Newton modified LP-Newton method. 634-649 - M. Momeni, M. Reza Peyghami
A new conjugate gradient algorithm with cubic Barzilai-Borwein stepsize for unconstrained optimization. 650-664 - R. M. Oliveira
String-averaging incremental stochastic subgradient algorithms. 665-692
Volume 34, Number 4, 2019
- Narges Bidabadi
Using a spectral scaling structured BFGS method for constrained nonlinear least squares. 693-706 - Kai Tu
A new alternating projection-based prediction-correction method for structured variational inequalities. 707-730 - Hideaki Iiduka
Two stochastic optimization algorithms for convex optimization with fixed point constraints. 731-757 - Xin Zhao, Jinyan Fan:
A semidefinite method for tensor complementarity problems. 758-769 - Keyvan Amini
A modified Hestenes-Stiefel conjugate gradient method with an optimal property. 770-782 - Zahra Khoshgam
A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function. 783-796 - Fatemeh Keshavarz-Kohjerdi
Longest (s, t)-paths in L-shaped grid graphs. 797-826 - Maria Aparecida Diniz Ehrhardt, Deise Gonçalves Ferreira, Sandra A. Santos
A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions. 827-852 - Suthep Suantai, Yekini Shehu, Prasit Cholamjiak
Nonlinear iterative methods for solving the split common null point problem in Banach spaces. 853-874 - Francisco J. Aragón Artacho
The cyclic Douglas-Rachford algorithm with r-sets-Douglas-Rachford operators. 875-889 - Wim van Ackooij
Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies. 890-920
Volume 34, Number 5, 2019
Forewords
- Foreword. 921
- Xiaoyu Wang, Xiao Wang, Ya-Xiang Yuan:
Stochastic proximal quasi-Newton methods for non-convex composite optimization. 922-948 - Jörg Fliege
Complexity of gradient descent for multiobjective optimization. 949-959 - Ali Mohammad Nezhad
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity. 960-990 - Paul Armand, Ngoc Nguyen Tran:
Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization. 991-1013 - Goran Lesaja, Florian A. Potra:
Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP. 1014-1034 - Andreas Griewank
Finite convergence of an active signature method to local minima of piecewise linear functions. 1035-1055 - Francesca Guerriero
A rollout algorithm for the resource constrained elementary shortest path problem. 1056-1074 - Pavel Otta
Newton projection with proportioning using iterative linear algebra for model predictive control with long prediction horizon. 1075-1098 - Francesco Bagattini
Clustering methods for large scale geometrical global optimization. 1099-1122
Volume 34, Number 6, 2019
- Gabriel Ruiz Garzón
The continuous-time problem with interval-valued functions: applications to economic equilibrium. 1123-1144 - Javad Koushki
Anchor points in multiobjective optimization: definition, characterization and detection. 1145-1167 - Chibueze Christian Okeke, Chinedu Izuchukwu
A strong convergence theorem for monotone inclusion and minimization problems in complete CAT(0) spaces. 1168-1183 - Alfredo N. Iusem, Joaquim João Júdice
Splitting methods for the Eigenvalue Complementarity Problem. 1184-1212 - Esmaeil Afrashteh
Optimal algorithms for selective variants of the classical and inverse median location problems on trees. 1213-1230 - Dimitris Souravlias
Parallel algorithm portfolios with performance forecasting. 1231-1250 - Yuan Shen, Hongyu Xu, Xin Liu:
An alternating minimization method for robust principal component analysis. 1251-1276 - Wanyou Cheng, Qingjie Hu, Donghui Li:
A fast conjugate gradient algorithm with active set prediction for ℓ1 optimization. 1277-1305
- Stefanie Günther, Nicolas R. Gauger
A non-intrusive parallel-in-time approach for simultaneous optimization with unsteady PDEs. 1306-1321
- Alfredo Canelas
A feasible direction algorithm for nonlinear second-order cone programs. 1322-1341
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-12-29 01:17 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: