conftrace_

interior point method

19 papers

Explore in graph

Also known as

IPM

Co-occurring keywords

convex optimization (1321) linear programming (227) randomized linear algebra (6) neural network (6616) support vector machine (978) conjugate gradient (43) random walk (161) markov chain monte carlo (725) piecewise linear quadratic penalty (1) central path (1)

Papers

IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs NIPS 2024
Exploring the Power of Graph Neural Networks in Solving Linear Optimization Problems AISTATS 2024
Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling COLT 2024
A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport AISTATS 2024
Inference for probabilistic dependency graphs UAI 2023
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity NIPS 2022
Faster Randomized Interior Point Methods for Tall/Wide Linear Programs JMLR 2022
On the Convergence of Inexact Predictor-Corrector Methods for Linear Programming ICML 2022
Interior Point Solving for LP-based prediction+optimisation NIPS 2020
Faster Randomized Infeasible Interior Point Methods for Tall/Wide Linear Programs NIPS 2020
Learning Linear Programs from Optimal Decisions NIPS 2020
Solving Empirical Risk Minimization in the Current Matrix Multiplication Time COLT 2019
Fast MCMC Sampling Algorithms on Polytopes JMLR 2018
Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier ICML 2016
Sparse/Robust Estimation and Kalman Smoothing with Nonsmooth Log-Concave Densities: Modeling, Computation, and Theory JMLR 2013
Algorithms and hardness results for parallel large margin learning NIPS 2011
A Fast Hybrid Algorithm for Large-Scale -Regularized Logistic Regression JMLR 2010
Hybrid MPI/OpenMP Parallel Linear Support Vector Machine Training JMLR 2009
Efficient SVM Training Using Low-Rank Kernel Representations JMLR 2001