mlsanityData to 7 Oct 2026

KKT-Informed Neural Network

arXiv 2409.09087 ↗First posted 11 Sep 2024math.OC cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 4 of its 5 references that are in the map. First posted on arXiv 11 Sep 2024.

Builds on

4 of 5 references.

References · 4

  1. 2021Convex optimizationcited by 2,479
  2. 2019Differentiable Convex Optimization Layerscited by 458
  3. 2021Gym-ANM: Reinforcement Learning Environments for Active Network Management Tasks in Electricity Distribution Systemscited by 18
  4. 2024Jacobian Descent for Multi-Objective Optimizationcited by 18

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.