Co-occurring keywords · papers mentioning both
Papers
A Probabilistic Measure of Multi-Robot Connectivity and Ergodic Optimal Control
RSS 2025
Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction
JMLR 2025
Sparse SVM with Hard-Margin Loss: a Newton-Augmented Lagrangian Method in Reduced Dimensions
JMLR 2025
An Effective Augmented Lagrangian Method for Fine-Grained Multi-View Optimization
AAAI 2024
Improving Deep Learning Optimization through Constrained Parameter Regularization
NeurIPS 2024
Inexact Augmented Lagrangian Methods for Conic Optimization: Quadratic Growth and Linear Convergence
NeurIPS 2024
On Efficient and Scalable Computation of the Nonparametric Maximum Likelihood Estimator in Mixture Models
JMLR 2024
An Inexact Augmented Lagrangian Algorithm for Training Leaky ReLU Neural Network with Group Sparsity
JMLR 2023
First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems
JMLR 2023
MARS: A Second-Order Reduction Algorithm for High-Dimensional Sparse Precision Matrices Estimation
JMLR 2023
Self-Supervised Primal-Dual Learning for Constrained Optimization
AAAI 2023
A Stochastic Linearized Augmented Lagrangian Method for Decentralized Bilevel Optimization
NeurIPS 2022
On the Convergence of Continuous Constrained Optimization for Structure Learning
AISTATS 2022
Zeroth-Order Optimization for Composite Problems with Functional Constraints
AAAI 2022
Constrained Optimization to Train Neural Networks on Critical and Under-Represented Classes
NeurIPS 2021
Convex Clustering: Model, Theoretical Guarantee and Efficient Algorithm
JMLR 2021
Identification and Estimation of Joint Probabilities of Potential Outcomes in Observational Studies with Covariate Information
NeurIPS 2021
PenDer: Incorporating Shape Constraints via Penalized Derivatives
AAAI 2021
Rate-improved inexact augmented Lagrangian method for constrained nonconvex optimization
AISTATS 2021
A Differentiable Augmented Lagrangian Method for Bilevel Nonlinear Optimization
RSS 2019
Combining ADMM and the Augmented Lagrangian Method for Efficiently Handling Many Constraints
IJCAI 2019
Guaranteed Matrix Completion Under Multiple Linear Transformations
CVPR 2019
Robust Flexible Feature Selection via Exclusive L21 Regularization
IJCAI 2019
Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method
JMLR 2019
An Efficient Semismooth Newton based Algorithm for Convex Clustering
ICML 2018