Solving dual problems using a coevolutionary optimization algorithm

DOI10.1007/S10898-012-9981-5zbMATH Open1286.90141OpenAlexW2022773419MaRDI QIDQ2434646FDOQ2434646

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

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

zbMATH Keywords

duality gapevolutionary algorithmsdual problemnonsmooth optimization algorithmscoevolutionary algorithm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Approximate Bilevel Optimization with Population-Based Evolutionary Algorithms
• Metaheuristics for bilevel optimization: a comprehensive review
• A study on the use of heuristics to solve a bilevel programming problem

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)