Solving dual problems using a coevolutionary optimization algorithm

DOI10.1007/S10898-012-9981-5MaRDI QIDQ2434646zbMATH OpenOpenAlexFDO

Authors Kalyanmoy Deb, Shivam Gupta, Joydeep Dutta, Bhoomija Ranjan

Publication date 6 February 2014

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-012-9981-5

zbMATH Keywords

coevolutionary algorithmdual problemduality gapevolutionary algorithmsnonsmooth optimization algorithms

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An evolutionary algorithm for solving bilevel programming problems using duality conditions
• scientific article; zbMATH DE number 2086454
• A general theory of dual optimization problems
• Dual multilevel optimization
• Local statements on dual methods in problems of multilevel optimization

Cites work

• A numerically stable dual method for solving strictly convex quadratic programs
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
• scientific article; zbMATH DE number 98525 (Why is no real title available?)
• scientific article; zbMATH DE number 2002582 (Why is no real title available?)
• scientific article; zbMATH DE number 778137 (Why is no real title available?)
• scientific article; zbMATH DE number 852844 (Why is no real title available?)
• Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus^§
• Multi-objective optimization using evolutionary algorithms
• New bundle methods for solving Lagrangian relaxation dual problems
• New limited memory bundle method for large-scale nonsmooth optimization
• Nonlinear optimization.
• Nonlinear Programming
• Primal-dual solution for the linear programming problems using neural networks
• Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
• Subgradients of distance functions at out-of-set points

Cited in

(3)

• A study on the use of heuristics to solve a bilevel programming problem
• Approximate bilevel optimization with population-based evolutionary algorithms
• Metaheuristics for bilevel optimization: a comprehensive review

Describes a project that uses

Uses Software

• LMBM
• DGM
• LDGB

This page was built for publication: Solving dual problems using a coevolutionary optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434646)