default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 56
Volume 56, Number 1, September 2013
- Warren L. Hare, Julie Nutini:
A derivative-free approximate gradient sampling algorithm for finite minimax problems. 1-38 - Robert Michael Lewis, Stephen G. Nash:
Using inexact gradients in a multilevel optimization algorithm. 39-61 - Jinyan Fan:
A Shamanskii-like Levenberg-Marquardt method for nonlinear equations. 63-80 - Li Yang, Bo Yu
:
A homotopy method for nonlinear semidefinite programming. 81-96 - José Rui Figueira, Luís Paquete, Marco Simões, Daniel Vanderpooten:
Algorithmic improvements on dynamic programming for the bi-objective {0, 1} knapsack problem. 97-111 - Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, Sergiy Butenko:
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. 113-130 - Wei Gong, Michael Hinze:
Error estimates for parabolic optimal control problems with control and state constraints. 131-151 - Rico Buchholz, Harald Engel, Eileen Kammann, Fredi Tröltzsch:
On the optimal control of the Schlögl-model. 153-185 - Rico Buchholz, Harald Engel, Eileen Kammann, Fredi Tröltzsch:
Erratum to: On the optimal control of the Schlögl-model. 187-188 - Federico Zuiani, Massimiliano Vasile:
Multi Agent Collaborative Search based on Tchebycheff decomposition. 189-208 - Gregor Papa:
Parameter-less algorithm for evolutionary-based optimization. 209-229 - Pietro Marco Congedo, Jeroen A. S. Witteveen, Gianluca Iaccarino:
A simplex-based numerical framework for simple and efficient robust design optimization. 231-251
Volume 56, Number 2, October 2013
- Giovanni Fasano, Massimo Roma:
Preconditioning Newton-Krylov methods in nonconvex large scale optimization. 253-290 - Blair Lennon Robertson, Christopher John Price, Marco Reale:
CARTopt: a random search method for nonsmooth unconstrained optimization. 291-315 - Dongyi Liu, Genqi Xu:
Symmetric Perry conjugate gradient method. 317-341 - Csaba I. Fábián, Olga Papp, Krisztián Eretnek:
Implementing the simplex method as a cutting-plane method, with a view to regularization. 343-368 - Samuel Amstutz, Antoine Laurain:
A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints. 369-403 - Francesco Carrabs, Raffaele Cerulli, Manlio Gaudioso, Monica Gentili:
Lower and upper bounds for the spanning tree with minimum branch vertices. 405-438 - Kata Kiatmanaroj, Christian Artigues, Laurent Houssin, Frédéric Messine:
Frequency assignment in a SDMA satellite communication system with beam decentring feature. 439-455 - Mahamed G. H. Omran, Salah Al-Sharhan, Ayed A. Salman, Maurice Clerc:
Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms. 457-480 - Peter Korosec, Jurij Silc:
The continuous differential ant-stigmergy algorithm for numerical optimization. 481-502
Volume 56, Number 3, December 2013
- COAP 2012 Best Paper Prize. 503-506
- Chengbo Li, Wotao Yin, Hong Jiang, Yin Zhang:
An efficient augmented Lagrangian method with applications to total variation minimization. 507-530 - Huixian Wu, Hezhi Luo, Xiaodong Ding, Guanting Chen:
Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming. 531-558 - Bingsheng He, Xiaoming Yuan, Wenxing Zhang:
A customized proximal point algorithm for convex minimization with linear constraints. 559-572 - María D. González-Lima, Aurelio R. L. Oliveira, Danilo E. Oliveira:
A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming. 573-597 - Shuisheng Zhou, Jiangtao Cui, Feng Ye, Hongwei Liu, Qiang Zhu:
New smoothing SVM algorithm with tight error bound and efficient reduced techniques. 599-617 - Edoardo Amaldi, Kanika Dhyani, Leo Liberti:
A two-phase heuristic for the bottleneck k-hyperplane clustering problem. 619-633 - Pierre Carpentier, Guy Cohen, Anes Dallagi:
Particle methods for stochastic optimal control problems. 635-674 - Sivashan Chetty, Aderemi Oluyinka Adewumi:
Three new stochastic local search algorithms for continuous optimization problems. 675-721 - Rafael Blanquero, Emilio Carrizosa:
Solving the median problem with continuous demand on a network. 723-734 - Ellips Masehian, Hossein Akbaripour, Nasrin Mohabbati-Kalejahi:
Landscape analysis and efficient metaheuristics for solving the n-queens problem. 735-764
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-12-13 20:33 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:
