Solving dual problems using a coevolutionary optimization algorithm
DOI10.1007/s10898-012-9981-5zbMath1286.90141OpenAlexW2022773419MaRDI QIDQ2434646
Bhoomija Ranjan, Shivam Gupta, Joydeep Dutta, Kalyanmoy Deb
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
dual problemduality gapevolutionary algorithmsnonsmooth optimization algorithmscoevolutionary algorithm
Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Uses Software
Cites Work
- A numerically stable dual method for solving strictly convex quadratic programs
- New bundle methods for solving Lagrangian relaxation dual problems
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Subgradients of distance functions at out-of-set points
- Primal-dual solution for the linear programming problems using neural networks
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- Equivalent Subgradient Versions of Hamiltonian and Euler–Lagrange Equations in Variational Analysis
- New limited memory bundle method for large-scale nonsmooth optimization
- Nonlinear Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving dual problems using a coevolutionary optimization algorithm
