Latest Research in Convex Variational Programming

Top Research Topics in Convex Variational Programming

• Optimization and Control — 119 papers
• Statistics Theory — 22 papers
• Probability — 19 papers
• Numerical Analysis — 18 papers
• Information Theory — 9 papers
• Machine Learning — 6 papers
• Optimization and Variational Analysis — 5 papers
• Sparse and Compressive Sensing Techniques — 4 papers
• Markov Chains and Monte Carlo Methods — 4 papers
• Machine Learning — 4 papers

Highest-Cited Papers

1. A stochastic Lagrangian-based method for nonconvex optimization with nonlinear constraints (1 citations)
2. A Class of Zulfia Programming via KKT Conditions Without Assumptions
3. A Class of Invariant Programming Problems: A Convexity-Free and KKT-Independent Framework for Optimality
4. A Class of Invariant Programming Problems: A Convexity-Free and KKT-Independent Framework for Optimality
5. A Class of Zulfia Programming via KKT Conditions Without Assumptions
6. Robust, randomized preconditioning for kernel ridge regression (1 citations)
7. Generative Integration of CG Decomposition and Dual Structures for Stable Geometric Flows
8. A Three‐Term Modified PRP Conjugate Gradient Method for Unconstrained Optimization: Application to Image Restoration
9. A Unified Framework for Wasserstein Convergence of ULMC Methods beyond Log-Concavity: Old and New
10. Strong Duality in Risk-Constrained Nonconvex Functional Programming
11. Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates
12. PDNQP: A GPU-based Factorization-free Method for Large-scale Nonconvex Quadratic Programming
13. Structure-Aware Analyses and Algorithms for Interpolative Decompositions
14. Convergence in distribution of the P-P process in $L^1[0,1]$
15. Matching Multi-Loop Complexities with a Single Loop: Optimal Optimization Stationarity and Best-Known Game Stationarity in Nonconvex--Concave Minimax Optimization
16. Joint Structure Identification and Newton Acceleration via Proximal Line Search for Nonconvex Optimization
17. Coupling and Maximal Inequalities for Graph-Dependent Empirical Processes
18. Restart-Free Oracle-Efficient Methods for Strongly Convex Composite Optimization
19. RDT based upper bounds on the largest average submatrix values
20. Collect, Commit, Expand: Efficient CPQR-Based Column Selection for Extremely Wide Matrices

Sub-Regions

• Optimization and Control — 49 papers
• Statistics Theory — 40 papers
• Numerical Analysis — 38 papers
• Machine Learning — 26 papers
• Probability — 19 papers
• Stochastic Gradient Optimization Techniques — 14 papers