Computational Optimization and Applications

2006 - 2025

Current editor(s): William W. Hager

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 50, issue 3, 2011

International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences pp. 463-464

Hoai Le Thi and Joaquim Judice

Multi-product lot-sizing and sequencing on a single imperfect machine pp. 465-482

A. Dolgui, M. Kovalyov and K. Shchamialiova

Genetic Tabu search for robust fixed channel assignment under dynamic traffic data pp. 483-506

Hakim Mabed, Alexandre Caminada and Jin-Kao Hao

On solving Linear Complementarity Problems by DC programming and DCA pp. 507-524

Hoai Le Thi and Tao Pham Dinh

An efficient DC programming approach for portfolio decision with higher moments pp. 525-554

Tao Pham Dinh and Yi-Shuai Niu

Inexact restoration method for minimization problems arising in electronic structure calculations pp. 555-590

Juliano Francisco, J. Martínez, Leandro Martínez and Feodor Pisnitchenko

On solving the dual for portfolio selection by optimizing Conditional Value at Risk pp. 591-595

Wlodzimierz Ogryczak and Tomasz Śliwiński

Gradient algorithms for quadratic optimization with fast convergence rates pp. 597-617

Luc Pronzato and Anatoly Zhigljavsky

Counterexamples to a triality theorem in “Canonical dual least square method” pp. 619-628

M. Voisei and C. Zălinescu

Volume 50, issue 2, 2011

Foreword pp. 189-192

Xiaojun Chen and Masao Fukushima

The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions pp. 193-221

Hannes Buchholzer, Christian Kanzow, Peter Knabner and Serge Kräutle

An interior-point path-following algorithm for computing a Leontief economy equilibrium pp. 223-236

Chuangyin Dang, Yinyu Ye and Zhisu Zhu

Decomposition algorithms for generalized potential games pp. 237-262

Francisco Facchinei, Veronica Piccialli and Marco Sciandrone

Pricing American options with uncertain volatility through stochastic linear complementarity models pp. 263-286

Kenji Hamatani and Masao Fukushima

Network capacity management under competition pp. 287-326

Houyuan Jiang and Zhan Pang

Block relaxation and majorization methods for the nearest correlation matrix with factor structure pp. 327-349

Qingna Li, Houduo Qi and Naihua Xiu

A smoothing Newton-type method for solving the L 2 spectral estimation problem with lower and upper bounds pp. 351-378

Chen Ling, Hongxia Yin and Guanglu Zhou

A smoothing sample average approximation method for stochastic optimization problems with CVaR risk measure pp. 379-401

Fanwen Meng, Jie Sun and Mark Goh

Computation of generalized differentials in nonlinear complementarity problems pp. 403-423

Shuhuang Xiang and Xiaojun Chen

Compression and denoising using l 0 -norm pp. 425-444

Andy Yau, Xuecheng Tai and Michael Ng

A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem pp. 445-461

Liping Zhang and Soon-Yi Wu

Volume 50, issue 1, 2011

Approximating Hessians in unconstrained optimization arising from discretized problems pp. 1-22

Vincent Malmedy and Philippe Toint

Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems pp. 23-48

Axel Dreves and Christian Kanzow

A new class of penalized NCP-functions and its properties pp. 49-73

J.-S. Chen, Z.-H. Huang and C.-Y. She

Some aspects of reachability for parabolic boundary control problems with control constraints pp. 75-110

Vili Dhamo and Fredi Tröltzsch

A smooth penalty approach and a nonlinear multigrid algorithm for elliptic MPECs pp. 111-145

M. Hintermüller and I. Kopacka

Shape optimization of an airfoil in the presence of compressible and viscous flows pp. 147-162

B. Farhadinia

A realization of constraint feasibility in a moving least squares response surface based approximate optimization pp. 163-188

Chang Song and Jongsoo Lee

Volume 49, issue 3, 2011

A framework for analyzing sub-optimal performance of local search algorithms pp. 407-433

Alexander Nikolaev, Sheldon Jacobson, Shane Hall and Darrall Henderson

An active index algorithm for the nearest point problem in a polyhedral cone pp. 435-456

Zhe Liu and Yahya Fathi

The penalized Fischer-Burmeister SOC complementarity function pp. 457-491

Shaohua Pan, Jein-Shan Chen, Sangho Kum and Yongdo Lim

A new hybrid method for nonlinear complementarity problems pp. 493-520

Shao-Jian Qu, Mark Goh and Xiujie Zhang

Reduced quasi-Newton method for simultaneous design and optimization pp. 521-548

Adel Hamdi and Andreas Griewank

Elliptic control problems with gradient constraints—variational discrete versus piecewise constant controls pp. 549-566

Andreas Günther and Michael Hinze

Optimal control of the Stokes equations: conforming and non-conforming finite element methods under reduced regularity pp. 567-600

Serge Nicaise and Dieter Sirch

Volume 49, issue 1, 2011

Direct search algorithm for bilevel programming problems pp. 1-15

Ayalew Mersha and Stephan Dempe

An improved proximal alternating direction method for monotone variational inequalities with separable structure pp. 17-29

Xiaoming Yuan

A reduced Hessian SQP method for inequality constrained optimization pp. 31-59

Tao-Wen Liu

A class of nonlinear Lagrangians for nonconvex second order cone programming pp. 61-99

Liwei Zhang, Jian Gu and Xiantao Xiao

Augmented Lagrangian for cone constrained topology optimization pp. 101-122

Samuel Amstutz

Optimal boundary control of the wave equation with pointwise control constraints pp. 123-147

Martin Gugat and Volker Grimm

Numerical solution for optimal control of the reaction-diffusion equations in cardiac electrophysiology pp. 149-178

Chamakuri Nagaiah, Karl Kunisch and Gernot Plank

Generalized viscosity approximation methods in multiobjective optimization problems pp. 179-192

Zhe Chen

Minimum power multicasting in wireless networks under probabilistic node failures pp. 193-212

János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili and Chefi Triki

Volume 48, issue 3, 2011

Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints pp. 423-452

Koichi Nabetani, Paul Tseng and Masao Fukushima

Corrector-predictor methods for sufficient linear complementarity problems pp. 453-485

Filiz Gurtuna, Cosmin Petra, Florian Potra, Olena Shevchenko and Adrian Vancea

Weighted variational inequalities in non-pivot Hilbert spaces with applications pp. 487-514

Annamaria Barbagallo and Stéphane Pia

Sufficient descent directions in unconstrained optimization pp. 515-532

Xiao-Min An, Dong-Hui Li and Yunhai Xiao

Planning wireless networks by shortest path pp. 533-551

C. Mannino, S. Mattia and A. Sassano

Sensitivity analysis and calibration of the covariance matrix for stable portfolio selection pp. 553-579

Vincent Guigues

Discretization of interior point methods for state constrained elliptic optimal control problems: optimal error estimates and parameter adjustment pp. 581-600

Michael Hinze and Anton Schiela

A globally convergent semi-smooth Newton method for control-state constrained DAE optimal control problems pp. 601-633

Matthias Gerdts and Martin Kunkel

A global optimization method for the design of space trajectories pp. 635-652

Bernardetta Addis, Andrea Cassioli, Marco Locatelli and Fabio Schoen

Relaxing the optimality conditions of box QP pp. 653-673

Samuel Burer and Jieqiu Chen

Covering a polygonal region by rectangles pp. 675-695

Y. Stoyan, T. Romanova, G. Scheithauer and A. Krivulya

Tabu search for the linear ordering problem with cumulative costs pp. 697-715

Abraham Duarte, Manuel Laguna and Rafael Martí

Primal-dual interior-point method for thermodynamic gas-particle partitioning pp. 717-745

Alexandre Caboussat

Volume 48, issue 1, 2011

Local convergence analysis of inexact Newton-like methods under majorant condition pp. 1-21

O. Ferreira and M. Gonçalves

Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints pp. 23-44

Zdeněk Dostál, Marta Domorádová and Marie Sadowská

A globally and quadratically convergent method for absolute value equations pp. 45-58

Louis Caccetta, Biao Qu and Guanglu Zhou

An improved trust region algorithm for nonlinear equations pp. 59-70

Jinyan Fan and Jianyu Pan

A cyclic scheduling problem with an undetermined number of parallel identical processors pp. 71-90

Přemysl Šůcha and Zdeněk Hanzálek

How much do we “pay” for using default parameters? pp. 91-108

Mustafa Baz, Brady Hunsaker and Oleg Prokopyev

A fast steady-state ε-dominance multi-objective evolutionary algorithm pp. 109-138

Minqiang Li, Liu Liu and Dan Lin

Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems pp. 139-155

Li-Ning Xing, Ying-Wu Chen and Ke-Wei Yang