Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization

DOI10.1007/s12046-016-0466-yzbMath1348.90517MaRDI QIDQ332770

A. G. Ramakrishnan, Deepak Kumar

Publication date: 9 November 2016

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: http://eprints.iisc.ac.in/53917/1/Sad_41-3_289_2016.pdf

zbMATH Keywords

quadratic programming; hyperplane; particle swarm optimization; binary classification; quadratic constraints

Mathematics Subject Classification ID

90C20: Quadratic programming

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• UCI-ml
• PRMLT
• GSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
• A new polynomial-time algorithm for linear programming
• On standard quadratic optimization problems
• Support-vector networks
• Multi-standard quadratic optimization: Interior point methods and cone programming reformulation
• Newton-Raphson Consensus for Distributed Convex Optimization
• Distributed Subgradient Methods for Multi-Agent Optimization
• Constrained Consensus and Optimization in Multi-Agent Networks