Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution

DOI10.1137/22M1488892zbMath1528.90151arXiv2204.02366OpenAlexW4226404148MaRDI QIDQ6071888

Nadia Oudjane, Cheng Wan, Laurent Pfeiffer, Joseph Frédéric Bonnans, Kang Liu

Publication date: 29 November 2023

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.02366

zbMATH Keywords

relaxationdecentralizationconcentration inequalitiesmultiagent optimizationaggregative optimizationFrank Wolfe algorithmlarge-scale and nonconvex optimizationprivacy-preserving methods

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Numerical methods of relaxation type (49M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Fast projection onto the simplex and the \(l_1\) ball
• Conditional gradient algorithms with open loop step size rules
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Outer approximation with conic certificates for mixed-integer convex problems
• Frank-Wolfe style algorithms for large scale optimization
• Decomposition of convex high dimensional aggregative stochastic control problems
• Sparse Modeling for Image and Vision Processing
• Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Measures of the non-convexity of sets and the Shapley–Folkman–Starr theorem
• Estimates of the Duality Gap in Nonconvex Optimization
• A mean field view of the landscape of two-layer neural networks
• Generalized Conditional Gradient with Augmented Lagrangian for Composite Minimization
• A Privacy-Preserving Method to Optimize Distributed Resource Allocation
• Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization
• Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization
• On the Convergence of Block Coordinate Descent Type Methods
• Quasi-Equilibria in Markets with Non-Convex Preferences
• Convex analysis and monotone operator theory in Hilbert spaces
• Introduction to nonparametric estimation

This page was built for publication: Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution