Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 59
Volume 59, Numbers 1-2, October 2014
- Xiaojun Chen
, Nobuo Yamashita:
Preface. 1-4 - Roger Behling, Andreas Fischer, Markus Herrich, Alfredo N. Iusem, Yinyu Ye:
A Levenberg-Marquardt method with approximate projections. 5-26 - Samuel Burer, Sunyoung Kim, Masakazu Kojima:
Faster, but weaker, relaxations for quadratically constrained quadratic programs. 27-45 - Xiaojun Chen, Weijun Zhou:
Convergence of the reweighted ℓ 1 minimization algorithm for ℓ 2-ℓ p minimization. 47-61 - Axel Dreves, Francisco Facchinei, Andreas Fischer, Markus Herrich:
A new error bound result for Generalized Nash Equilibrium Problems and its algorithmic application. 63-84 - Francisco Facchinei, Jong-Shi Pang, Gesualdo Scutari:
Non-cooperative games with minmax objectives. 85-112 - Luís M. Fernandes, Joaquim João Júdice, Hanif D. Sherali, Maria Antónia Forjaz:
On an enumerative algorithm for solving eigenvalue complementarity problems. 113-134 - Guoyong Gu, Bingsheng He, Xiaoming Yuan:
Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach. 135-161 - William W. Hager, Hongchao Zhang:
An affine scaling method for optimization problems with polyhedral constraints. 163-183 - Edward Hult, Houyuan Jiang, Daniel Ralph:
Exact computational approaches to a stochastic uncapacitated single allocation p-hub center problem. 185-200 - Alexey F. Izmailov, Mikhail V. Solodov:
On error bounds and Newton-type methods for generalized Nash equilibrium problems. 201-218 - Bo Jiang, Zhening Li, Shuzhong Zhang:
Approximation methods for complex polynomial optimization. 219-248 - Christian Kanzow, Alexandra Schwartz:
Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints. 249-262 - Dong-Hui Li, Lei Wu, Zhe Sun, Xiongji Zhang:
A constrained optimization reformulation and a feasible descent direction method for L1/2 regularization. 263-284 - Chongyang Liu, Ryan C. Loxton, Kok Lay Teo:
Optimal parameter selection for nonlinear multistage systems with time-delays. 285-306 - Liqun Qi, Yinyu Ye:
Space tensor conic programming. 307-319 - Kenji Ueda, Nobuo Yamashita:
A regularized Newton method without line search for unconstrained optimization. 321-351 - Mengwei Xu, Jane J. Ye:
A smoothing augmented Lagrangian method for solving simple bilevel programs. 353-377 - Xiaojin Zheng, Xiaoling Sun, Duan Li, Jie Sun:
Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach. 379-397
Volume 59, Number 3, December 2014
- COAP 2013 Best Paper Prize. 399-403
- Paul Armand, Joël Benoist, Riadh Omheni, Vincent Pateloup:
Study of a primal-dual algorithm for equality constrained minimization. 405-433 - Chungen Shen, Lei-Hong Zhang, Bo Wang, Wenqiong Shao:
Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization. 435-473 - Vyacheslav Kungurtsev, Moritz Diehl:
Sequential quadratic programming methods for parametric nonlinear optimization. 475-509 - Silvia Bonettini, Valeria Ruggiero:
An alternating extragradient method with non euclidean projections for saddle point problems. 511-540 - Roberta De Asmundis, Daniela di Serafino, William W. Hager, Gerardo Toraldo, Hongchao Zhang:
An efficient gradient method using the Yuan steplength. 541-563 - Margherita Porcelli, Francesco Rinaldi:
A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell _1\) -regularized least-squares. 565-589 - Mengwei Xu, Soon-Yi Wu, Jane J. Ye:
Solving semi-infinite programs by smoothing projected gradient method. 591-616 - Daniel G. Espinoza, Eduardo Moreno:
A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs. 617-638 - Mustafa R. Kilinç, Jeff T. Linderoth, James R. Luedtke, Andrew Miller:
Strong-branching inequalities for convex mixed integer nonlinear programs. 639-665 - Daniel P. Word, Jia Kang, Johan Åkesson, Carl D. Laird:
Efficient parallel solution of large-scale nonlinear dynamic optimization problems. 667-688 - Alina Chertock, Michael Herty, Alexander Kurganov:
An Eulerian-Lagrangian method for optimization problems governed by multidimensional nonlinear hyperbolic PDEs. 689-724 - Morteza Alinia Ahandani, Mohammad-Taghi Vakil-Baghmisheh, Mohammad Talebi:
Hybridizing local search algorithms for global optimization. 725-748
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-30 20:02 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:
