default search action
Optimization Methods and Software, Volume 31
Volume 31, Number 1, 2016
- Yavdat Il'yasov, Aleksandr Ivanov
:
Computation of maximal turning points to nonlinear equations by nonsmooth optimization. 1-23 - Luís M. Fernandes
The second-order cone eigenvalue complementarity problem. 24-52 - Olga Perederieieva, Matthias Ehrgott
Numerical stability of path-based algorithms for traffic assignment. 53-67 - Qiulian Chen, Yaodong Cui, Yan Chen:
Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns. 68-87 - Jordi Castro
Interior-point solver for convex separable block-angular problems. 88-109 - Shubhangi G. Deshpande, Layne T. Watson, Robert A. Canfield
Multiobjective optimization using an adaptive weighting scheme. 110-133 - Masakazu Muramatsu, Hayato Waki
Perturbed sums-of-squares theorem for polynomial optimization and its applications. 134-156 - Frank E. Curtis
Adaptive augmented Lagrangian methods: algorithms and practical numerical experience. 157-186 - Le Hong Trang
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints. 187-203 - Nadia Smairi, Patrick Siarry, Khaled Ghédira:
A hybrid particle swarm approach based on Tribes and tabu search for multi-objective optimization. 204-231
Volume 31, Number 2, 2016
- Soodabeh Asadi
On the P*(κ) horizontal linear complementarity problems over Cartesian product of symmetric cones. 233-257 - Fengmin Xu, Zhaosong Lu
An efficient optimization approach for a cardinality-constrained index tracking problem. 258-271 - Elham Mardaneh
A heuristic algorithm for optimal fleet composition with vehicle routing considerations. 272-289 - Bader Al-Shamary, Shashi Kant Mishra
On approximate starshapedness in multiobjective optimization. 290-304 - Maria Teresa Vespucci
Two-stage stochastic mixed integer optimization models for power generation capacity expansion with risk measures. 305-327 - Douglas Soares Gonçalves
A projected gradient method for optimization over density matrices. 328-341 - Yoon Mo Jung, Sangwoon Yun:
A coordinate descent homotopy method for linearly constrained nonsmooth convex minimization. 342-358 - Farnaz Hooshmand
Efficient constraint reduction in multistage stochastic programming problems with endogenous uncertainty. 359-376 - Aaditya Ramdas, Javier Peña:
Towards a deeper geometric, analytic and algorithmic understanding of margins. 377-391 - Krzysztof Michalak
Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems. 392-404 - Jan Heller, Tomás Pajdla:
GpoSolver: a Matlab/C++ toolbox for global polynomial optimization. 405-434 - Csaba Mészáros:
Exploiting hardware capabilities in interior point methods. 435-443
Volume 31, Number 3, 2016
- Sirma Zeynep Alparslan Gök, Gerhard-Wilhelm Weber
Foreword. 445 - Derya Dinler, Mustafa Kemal Tural
A minisum location problem with regional demand considering farthest Euclidean distances. 446-470 - Mustafa Kemal Tural
Maximal matching polytope in trees. 471-478 - Asghar Asgharian-Sardroud
An approximation algorithm for the longest path problem in solid grid graphs. 479-493 - Andrea Walther
On an extension of one-shot methods to incorporate additional constraints. 494-510 - Phillipe Rodrigues Sampaio, Philippe L. Toint:
Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints. 511-534
- Marius Durea
Minimal time function with respect to a set of directions: basic properties and applications. 535-561 - S. Ahmad Hosseini
A feasibility evaluation approach for time-evolving multi-item production-distribution networks. 562-576 - Yunlong Cheng, Qiong Mou, Xianbing Pan, Shengwei Yao:
A sufficient descent conjugate gradient method and its global convergence. 577-590 - Geovani Nunes Grapiglia, Jin Yun Yuan, Ya-Xiang Yuan:
On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization. 591-604 - Nitish Shirish Keskar, Jorge Nocedal, Figen Öztoprak, Andreas Wächter:
A second-order method for convex l1-regularized optimization with active-set prediction. 605-621 - Michal Kocvara
A first-order multigrid method for bound-constrained convex optimization. 622-644 - Ion Necoara, Andrei Patrascu
Iteration complexity analysis of dual first-order methods for conic convex programming. 645-678
Volume 31, Number 4, 2016
Preface
- Duan Li
Dedicated to the memory of Professor Xiaoling Sun (1963-2014). 679-680
- Qian Li, Yanqin Bai:
Optimal trade-off portfolio selection between total risk and maximum relative marginal risk. 681-700
- Van-Bong Nguyen, Ruey-Lin Sheu, Yong Xia:
An SDP approach for quadratic fractional problems with a two-sided quadratic constraint. 701-719 - Yong Xia, Duan Li
Strong duality in optimization: shifted power reformulation. 720-736 - Tiantian Nie, Shu-Cherng Fang, Zhibin Deng, John E. Lavery:
On linear conic relaxation of discrete quadratic programs. 737-754 - Xueting Cui, Shushang Zhu, Duan Li
Mean-variance portfolio optimization with parameter sensitivity control. 755-774 - Boshi Tian, Donghui Li, Xiaoqi Yang
An unconstrained differentiable penalty method for implicit complementarity problems. 775-790 - Xide Zhu
Improved convergence results for a modified Levenberg-Marquardt method for nonlinear equations and applications in MPCC. 791-804 - Ruixue Zhao, Jinyan Fan:
Global complexity bound of the Levenberg-Marquardt method. 805-814 - Yong Wang, Zheng-Hai Huang, Xue-Li Bai:
Exceptionally regular tensors and tensor complementarity problems. 815-828
Volume 31, Number 5, 2016
- Zheng Qu
Coordinate descent with arbitrary sampling I: algorithms and complexity. 829-857 - Zheng Qu
Coordinate descent with arbitrary sampling II: expected separable overapproximation. 858-884 - Laurent Hascoët, Jean Utke:
Programming language features, usage patterns, and the efficiency of generated adjoint code. 885-903 - Andreas Griewank
First- and second-order optimality conditions for piecewise smooth objective functions. 904-930 - Hideaki Iiduka
Incremental subgradient method for nonsmooth convex optimization with fixed point constraints. 931-951 - Masaru Ito, Mituhiro Fukuda
A family of subgradient-based methods for convex optimization problems in a unifying framework. 952-982 - Elias Salomão Helou
On the differentiability check in gradient sampling methods. 983-1007 - Tommaso Bianconcini
A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques. 1008-1035 - Axel Dreves
Solving linear generalized Nash equilibrium problems numerically. 1036-1063 - Michael C. Ferris
Modelling demand response in organized wholesale energy markets. 1064-1088 - Yanqin Bai, Renli Liang, Zhouwang Yang:
Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables. 1089-1109
Volume 31, Number 6, 2016
- Alexey F. Izmailov, Mikhail V. Solodov:
Some new facts about sequential quadratic programming methods employing second derivatives. 1111-1131 - Torsten Bosse
Augmenting the one-shot framework by additional constraints. 1132-1148 - Lino A. Costa
Benchmarking deterministic optimization algorithms using an outranking approach. 1149-1168 - Siyang Gao, Robert R. Meyer, Warren D. D'Souza, Leyuan Shi, Hao Howard Zhang:
A machine learning-based nested partitions framework for angle selection in radiotherapy. 1169-1188 - Touraj Nikazad
Convergence of string-averaging method for a class of operators. 1189-1208 - José Yunier Bello Cruz
On the convergence of the forward-backward splitting method with linesearches. 1209-1238
- Fei Liu, Ryan C. Loxton, Takashi Tsuchiya:
Preface. 1239
- Chun-Rong Chen, Xin Zuo, Fang Lu, Sheng-Jie Li:
Vector equilibrium problems under improvement sets and linear scalarization with stability applications. 1240-1257 - Sharareh Enshaei, Wah June Leong, Mahboubeh Farid
Diagonal quasi-Newton method via variational principle under generalized Frobenius norm. 1258-1271 - Shunsuke Hayashi, Takayuki Okuno, Yoshihiko Ito:
Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation. 1272-1297 - Shinji Mizuno:
The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption. 1298-1304 - Takayuki Okuno, Shunsuke Hayashi, Nobuo Yamashita, Kensuke Gomoto:
An exchange method with refined subproblems for convex semi-infinite programming problems. 1305-1324
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-27 21:16 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: