Latest Research in Optimization and Control

Top Research Topics in Optimization and Control

• Optimization and Control — 36 papers
• Numerical Analysis — 3 papers
• Statistics Theory — 2 papers
• Stochastic Gradient Optimization Techniques — 2 papers
• Markov Chains and Monte Carlo Methods — 1 papers
• Advanced Multi-Objective Optimization Algorithms — 1 papers
• Probability — 1 papers
• Sparse and Compressive Sensing Techniques — 1 papers
• Neural Networks and Applications — 1 papers
• Advanced Statistical Process Monitoring — 1 papers

Highest-Cited Papers

1. A stochastic Lagrangian-based method for nonconvex optimization with nonlinear constraints (1 citations)
2. Structure-Aware Analyses and Algorithms for Interpolative Decompositions
3. Subspace methods for min-max problems
4. Sharp Sobolev Sandwich and Approximation Rates of Radon-Domain $L^p$ Ridge Integral Spaces for ReLU$^k$ Networks
5. The Complexity of Finding Stationary Points in Nonsmooth Nonconvex Optimization
6. Exact Binary Projections for Array-RQMC: Joint Laws and Pathwise-Preserving Execution
7. Preconditioned Three-Term Conjugate Gradient Framework for Nonconvex Finite Minimax Problems
8. Generation of Custom Solvers in Rust for Convex Optimization
9. An Inexact Trust-Region Method for Structured Nonsmooth Optimization with Application to Risk-Averse Stochastic Programming
10. A global Barzilai and Borwein's normalized gradient descent method for unconstrained multiobjective optimization problems
11. Global and Unconditional $R$-Linear Convergence of Rank-Compressed Weighted LMSD Sweeps for Strictly Convex Quadratics
12. An $O(1/T^3)$ algorithm for minimizing convex quadratic functions over the $L_1$ ball
13. Convergence of a Randomized Newton Method in Nonconvex Optimization
14. Primal-Dual Inexact Newton-MR for Nonconvex Optimization with Equality Constraints
15. High-Probability Polynomial-Time Complexity of Restarted PDHG for Linear Programming
16. New Accelerated Past-Extragradient Methods with Variance Reduction for Generalized Equations
17. A Simple Complexity Lower Bound for Solving $Ax=b$
18. M-duality in fixed-point problems for general normed spaces
19. First-Order Optimization under Uniform Nondegeneracy: Geometry, Computation, and Information
20. Asymptotic Analysis of Gradient Mapping-type Stationarity Measure for the Sum of Nonconvex Nonsmooth Functions and Applications to Proximal Gradient-type Algorithms