Solving dual problems using a coevolutionary optimization algorithm

[1]  Kalyanmoy Deb,et al.  A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty function approach , 2010, IEEE Congress on Evolutionary Computation.

[2]  Qingfu Zhang,et al.  A surrogate-assisted evolutionary algorithm for minimax optimization , 2010, IEEE Congress on Evolutionary Computation.

[3]  Kalyanmoy Deb,et al.  Investigating EA solutions for approximate KKT conditions in smooth problems , 2010, GECCO '10.

[4]  Jürgen Branke,et al.  New Approaches to Coevolutionary Worst-Case Optimization , 2008, PPSN.

[5]  A. Bagirov,et al.  Discrete Gradient Method: Derivative-Free Method for Nonsmooth Optimization , 2008 .

[6]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

[7]  Boris S. Mordukhovich,et al.  SUBGRADIENTS OF DISTANCE FUNCTIONS AT OUT-OF-SET POINTS , 2006 .

[8]  Alaeddin Malek,et al.  Primal-dual solution for the linear programming problems using neural networks , 2005, Appl. Math. Comput..

[9]  Kaisa Miettinen,et al.  New limited memory bundle method for large-scale nonsmooth optimization , 2004, Optim. Methods Softw..

[10]  Kalyanmoy Deb,et al.  Optimization for Engineering Design: Algorithms and Examples , 2004 .

[11]  Rajkumar Roy,et al.  Bi-level optimisation using genetic algorithm , 2002, Proceedings 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS 2002).

[12]  X. Zhao,et al.  New Bundle Methods for Solving Lagrangian Relaxation Dual Problems , 2002 .

[13]  H. Barbosa A coevolutionary genetic algorithm for constrained optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[14]  Singiresu S Rao,et al.  Genetic algorithmic approach for multiobjective optimization of structures , 1993 .

[15]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[16]  Donald Goldfarb,et al.  A numerically stable dual method for solving strictly convex quadratic programs , 1983, Math. Program..

[17]  Thomas L. Magnanti,et al.  Applied Mathematical Programming , 1977 .

[18]  Napsu Karmitsa,et al.  LMBM — FORTRAN Subroutines for Large-Scale Nonsmooth Minimization: User's Manual , 2007 .

[19]  A. Ravindran,et al.  Engineering Optimization: Methods and Applications , 2006 .

[20]  Mikkel T. Jensen,et al.  A new look at solving minimax problems with coevolutionary genetic algorithms , 2004 .

[21]  Tamara G. Kolda,et al.  Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods , 2003, SIAM Rev..

[22]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[23]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[24]  K. Miettinen,et al.  Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus § , 1995 .

[25]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[26]  E. Spedicato Algorithms for continuous optimization : the state of the art , 1994 .

[27]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..