atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Solving Constrained Variational Inequalities via a First-order Interior Point-based Method

ICLR 2023 · Learning theory and algorithms › Combinatorial and search optimization · approach: Globally optimal geometric optimization · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use ACVI instead of projection-based saddle-point methodsConstrained VIs with rotational vector fields · 2D constrained VI problemszigzagging near constraintsHelped
Use ACVI instead of projection-based methodsConstrained VI solvers · 2D problems beyond the theoretical assumptionsdistance to solutionHelped
Use ACVI instead of projection-based saddle-point methodsConstrained VIs with limit cycles · Forsaken gameescape from limit cyclesHelped
Use ACVI instead of projection-based methodsBilinear game on the probability simplex · High-dimension bilinear gametime efficiencyHelped
Use ACVI instead of the corresponding projection-based baselineGAN training with linear inequality constraints · MNISTFIDHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy