Stop the war!
Остановите войну!
for scientists:
default search action
Computational Optimization and Applications, Volume 45
Volume 45, Number 1, January 2010
- Regina Sandra Burachik, C. Yalçin Kaya, Musa Mammadov:
An inexact modified subgradient algorithm for nonconvex optimization. 1-24 - António Pinto da Costa, Alberto Seeger:
Cone-constrained eigenvalue problems: theory and algorithms. 25-57 - Shaohua Pan, Jein-Shan Chen:
A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions. 59-88 - Jianzhong Zhang, Biao Qu, Naihua Xiu:
Some projection-like methods for the generalized Nash equilibria. 89-109 - Juana López Redondo, José-Jesús Fernández, Inmaculada García, Pilar Martínez Ortigosa:
Heuristics for the facility location and design (1|1)-centroid problem on the plane. 111-141 - Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti:
Fast paths in large-scale dynamic road networks. 143-158 - Adil M. Bagirov, Conny Clausen, Michael Kohler:
An algorithm for the estimation of a regression function by continuous piecewise linear functions. 159-179 - Robert Fourer, Jun Ma, R. Kipp Martin:
OSiL: An instance language for optimization. 181-203
Volume 45, Number 2, March 2010
- Gianni Di Pillo, Massimo Roma:
Guest editorial. 205-207 - Roberto Andreani, Ernesto G. Birgin, José Mario Martínez, María Laura Schuverdt:
Second-order negative-curvature methods for box-constrained and general constrained optimization. 209-236 - Immanuel M. Bomze, Werner Schachinger:
Multi-Standard Quadratic Optimization: interior point methods and cone programming reformulation. 237-256 - Andrea Cassioli, Marco Locatelli, Fabio Schoen:
Dissimilarity measures for population-based global optimization algorithms. 257-281 - Marco D'Apuzzo, Valentina De Simone, Daniela di Serafino:
On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods. 283-310 - Gianni Di Pillo, Giampaolo Liuzzi, Stefano Lucidi, Laura Palagi:
A truncated Newton method in an augmented Lagrangian framework for nonlinear programming. 311-352 - Giampaolo Liuzzi, Stefano Lucidi, Veronica Piccialli:
A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems. 353-375 - Scott R. McAllister, Christodoulos A. Floudas:
An improved hybrid global optimization method for protein tertiary structure prediction. 377-413 - Barbara Panicucci, Massimo Pappalardo, Mauro Passacantando:
Descent methods for a class of generalized variational inequalities. 415-425 - Houduo Qi, Defeng Sun:
Correlation stress testing for value-at-risk: an unconstrained convex optimization approach. 427-462 - Peng-Jun Wan, Ding-Zhu Du, Panos M. Pardalos, Weili Wu:
Greedy approximations for minimum submodular cover with submodular cost. 463-474
Volume 45, Number 3, April 2010
- Warren L. Hare, M. J. J. Liu, Tamás Terlaky:
Efficient preprocessing for VLSI optimization problems. 475-493 - Xiaojiao Tong, Soon-Yi Wu, Renjun Zhou:
New approach for the nonlinear programming with transient stability constraints arising from power systems. 495-520 - Ronaldo Dias, Nancy Lopes Garcia, Adriano Z. Zambom:
A penalized nonparametric method for nonlinear constrained optimization based on noisy data. 521-541 - Pasquale Avella, Maurizio Boccia, Igor Vasilyev:
A computational study of exact knapsack separation for the generalized assignment problem. 543-555 - Zheng-Hai Huang, Tie Ni:
Smoothing algorithms for complementarity problems over symmetric cones. 557-579 - Jein-Shan Chen, Shaohua Pan:
A one-parametric class of merit functions for the second-order cone complementarity problem. 581-606 - Olivier Klopfenstein:
Solving chance-constrained combinatorial problems to optimality. 607-638 - Akbar Karimi, Hadi Nobahari, Patrick Siarry:
Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions. 639-661
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.