Lagrangian relaxation procedure for cardinality-constrained portfolio optimization

By Shaw Dong   Liu Shucheng   Kopman Leonid  

Optimization Methods and Software, Vol. 23, Iss. 3, 2008-06 ,pp. : 411-420

Taylor & Francis Ltd

Access to resources Recommend Favorite

A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization

By Jian Jin-Bao  

Numerical Functional Analysis and Optimization, Vol. 29, Iss. 3-4, 2008-03 ,pp. : 376-409

Taylor & Francis Ltd

Access to resources Recommend Favorite

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

By Mak Vicky   Thomadsen Tommy  

Journal of Combinatorial Optimization, Vol. 11, Iss. 4, 2006-06 ,pp. : 421-434

Springer Publishing Company

Access to resources Recommend Favorite

A local relaxation method for the cardinality constrained portfolio optimization problem

By Murray Walter  

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 681-709

Springer Publishing Company

Access to resources Recommend Favorite

Annealing a Genetic Algorithm for Constrained Optimization

By Mendivil F.   Shonkwiler R.  

Journal of Optimization Theory and Applications, Vol. 147, Iss. 2, 2010-11 ,pp. : 395-410

Springer Publishing Company

Access to resources Recommend Favorite