KKT-Informed Neural Network
This method enables faster solving of optimization problems for applications requiring real-time or batch processing, though it is incremental as it builds on existing KKT-based approaches.
The paper tackles parametric convex optimization by training a neural network to predict optimal points using KKT condition penalties, achieving significant speed improvements for parallel solving.
A neural network-based approach for solving parametric convex optimization problems is presented, where the network estimates the optimal points given a batch of input parameters. The network is trained by penalizing violations of the Karush-Kuhn-Tucker (KKT) conditions, ensuring that its predictions adhere to these optimality criteria. Additionally, since the bounds of the parameter space are known, training batches can be randomly generated without requiring external data. This method trades guaranteed optimality for significant improvements in speed, enabling parallel solving of a class of optimization problems.