Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 54
Volume 54, Number 1, January 2013
- Serge Gratton, Selime Gürol, Philippe L. Toint
:
Preconditioning and globalizing conjugate gradients in dual space for quadratically penalized nonlinear-least squares problems. 1-25 - María Cristina Maciel, María G. Mendonça, Adriana B. Verdiell:
Monotone and nonmonotone trust-region-based algorithms for large scale unconstrained optimization problems. 27-43 - Gonglin Yuan, Zengxin Wei, Zhongxing Wang:
Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization. 45-64 - Yair Censor, Alexander J. Zaslavski:
Convergence and perturbation resilience of dynamic string-averaging projection methods. 65-76 - Touraj Nikazad, Mokhtar Abbasi:
An acceleration scheme for cyclic subgradient projections method. 77-91 - Takahito Kuno, Toshiyuki Masaki:
A practical but rigorous approach to sum-of-ratios optimization in geometric applications. 93-109 - Lei-Hong Zhang:
On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere. 111-139 - Alain Billionnet, Sourour Elloumi, Amélie Lambert:
An efficient compact quadratic convex reformulation for general integer quadratic programs. 141-162 - Adelaide Cerveira, Agostinho Agra, Fernando Bastos, Joaquim A. S. Gromicho:
A new Branch and Bound method for a discrete truss topology design problem. 163-187 - Moritz Diehl, Boris Houska, Oliver Stein, Paul Steuermann:
A lifting method for generalized semi-infinite programs based on lower level Wolfe duality. 189-210
Volume 54, Number 2, March 2013
- Mario Bertero, Valeria Ruggiero, Luca Zanni:
Guest editorial. 211-213 - Maïtine Bergounioux, Loïc Piffet:
A full second order variational model for multiscale texture analysis. 215-237 - Radu Ioan Bot, Christopher Hendrich:
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems. 239-262 - Paola Brianzi, Fabio Di Benedetto, Claudio Estatico:
Preconditioned iterative regularization in Banach spaces. 263-282 - Pengwen Chen, Changfeng Gui:
Linear convergence analysis of the use of gradient projection methods on total variation problems. 283-315 - Yunmei Chen, William W. Hager, Maryam Yashtini, Xiaojing Ye, Hongchao Zhang:
Bregman operator splitting with variable stepsize for total variation image reconstruction. 317-342 - Deren Han, Xiaoming Yuan, Wenxing Zhang, Xingju Cai:
An ADM-based splitting method for separable convex programming. 343-369 - Frank Lenzen, Florian Becker, Jan Lellmann, Stefania Petra, Christoph Schnörr:
A class of quasi-variational inequalities for adaptive image denoising and decomposition. 371-398 - Ignace Loris, Caroline Verhoeven:
An iterative algorithm for sparse and constrained recovery with applications to divergence-free current reconstructions in magneto-encephalography. 399-416 - Simon Setzer, Gabriele Steidl, Jan Morgenthaler:
A cyclic projected gradient method. 417-440 - Yunhai Xiao, Hong Zhu, Soon-Yi Wu:
Primal and dual alternating direction algorithms for ℓ 1-ℓ 1-norm minimization problems in compressive sensing. 441-459
Volume 54, Number 3, April 2013
- João Xavier da Cruz Neto, G. J. P. Da Silva, Orizon Pereira Ferreira, Jurandir O. Lopes:
A subgradient method for multiobjective optimization. 461-472 - Ellen H. Fukuda, L. M. Graña Drummond:
Inexact projected gradient method for vector optimization. 473-493 - Thai Doan Chuong:
Newton-like methods for efficient solutions in vector optimization. 495-516 - Lijie Bai, John E. Mitchell, Jong-Shi Pang:
On convex quadratic programs with linear complementarity constraints. 517-554 - Laurence Smith, John W. Chinneck, Victor C. Aitken:
Improved constraint consensus methods for seeking feasibility in nonlinear programs. 555-578 - Dianne P. O'Leary, Bert W. Rust:
Variable projection for nonlinear least squares problems. 579-593 - Damián R. Fernández, Elvio A. Pilotta, Germán Ariel Torres:
An inexact restoration strategy for the globalization of the sSQP method. 595-617 - Sara Mattia:
The robust network loading problem with dynamic routing. 619-643 - Maria Ayala, Abir Benabid, Christian Artigues, Claire Hanen:
The resource-constrained modulo scheduling problem: an experimental study. 645-673 - Hatem A. Fayed, Amir F. Atiya:
A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems. 675-703 - Hatem A. Fayed, Amir F. Atiya:
Erratum to: A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems. 705 - M. Montaz Ali, Wenxing Zhu:
A penalty function-based differential evolution algorithm for constrained global optimization. 707-739 - Iztok Fister, Marjan Mernik, Bogdan Filipic:
Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm. 741-770 - Saber M. Elsayed, Ruhul A. Sarker, Daryl Leslie Essam:
Self-adaptive differential evolution incorporating a heuristic mixing of operators. 771-790
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-07-03 21:28 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:
