Entity usage

Showing below up to 50 results in range #1 to #50.

1. A sequential quadratic programming method with high-probability complexity bounds for nonlinear equality-constrained stochastic optimization: Label: en
2. On the geometric convergence of Byzantine-resilient distributed optimization algorithms: Label: en
3. Accelerated minimax algorithms flock together: Label: en
4. Stochastic optimization over proximally smooth sets: Label: en
5. Policy mirror descent inherently explores action space: Label: en
6. Stability properties for parametric linear programs under data ambiguities: Label: en
7. Kurdyka-Łojasiewicz exponent via Hadamard parametrization: Label: en
8. Consistency of sample-based stationary points for infinite-dimensional stochastic optimization: Label: en
9. Convergence properties of proximal (sub)gradient methods without convexity or smoothness of any of the functions: Label: en
10. Derivative-free approaches for chance-constrained problems with right-hand side uncertainty: Label: en
11. Convergence rate of random scan coordinate ascent variational inference under log-concavity: Label: en
12. The computation of approximate feedback Stackelberg equilibria in multiplayer nonlinear constrained dynamic games: Label: en
13. Uniform weak sharp minima for multiobjective optimization problems: Label: en
14. Superlinear convergence of a semismooth Newton method for some optimization problems with applications to control theory: Label: en
15. Adaptive consensus: a network pruning approach for decentralized optimization: Label: en
16. An exact method for nonlinear network flow interdiction problems: Label: en
17. Sequential quadratic optimization for stochastic optimization with deterministic nonlinear inequality and equality constraints: Label: en
18. Solution of mismatched monotone+Lipschitz inclusion problems: Label: en
19. PolyCD: optimization via cycling through the vertices of a polytope: Label: en
20. Sample average approximation for stochastic programming with equality constraints: Label: en
21. Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach: Label: en
22. Face relative interior of convex sets in topological vector spaces: Label: en
23. Improving the global convergence of inexact restoration methods for constrained optimization problems: Label: en
24. Finite convergence of moment-SOS relaxations with nonreal radical ideals: Label: en
25. A branch-and-bound algorithm for nonconvex Nash equilibrium problems: Label: en
26. Efficient first order method for saddle point problems with higher order smoothness: Label: en
27. Zeroth-order Riemannian averaging stochastic approximation algorithms: Label: en
28. A disjunctive cutting plane algorithm for bilinear programming: Label: en
29. Parameter-free FISTA by adaptive restart and backtracking: Label: en
30. A search-free \(O(1/k^{3/2})\) homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities: Label: en
31. Proximity operators of perspective functions with nonlinear scaling: Label: en
32. Further development in convex conic reformulation of geometric nonconvex conic optimization problems: Label: en
33. Piecewise polyhedral relaxations of multilinear optimization: Label: en
34. Corrigendum and addendum to: ``Newton differentiability of convex functions in normed spaces and of a class of operators: Label: en
35. Newton-based alternating methods for the ground state of a class of multicomponent Bose-Einstein condensates: Label: en
36. Minimum spanning trees in infinite graphs: theory and algorithms: Label: en
37. On minimal extended representations of generalized power cones: Label: en
38. A functional model method for nonconvex nonsmooth conditional stochastic optimization: Label: en
39. Interpolation conditions for linear operators and applications to performance estimation problems: Label: en
40. Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems: Label: en
41. Consensus-based optimization methods converge globally: Label: en
42. A quadratically convergent sequential programming method for second-order cone programs capable of warm starts: Label: en
43. Data-driven distributionally robust multiproduct pricing problems under pure characteristics demand models: Label: en
44. Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems: Label: en
45. MIP relaxations in factorable programming: Label: en
46. On a differential generalized Nash equilibrium problem with mean field interaction: Label: en
47. MGProx: a nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization: Label: en
48. Variational and strong variational convexity in infinite-dimensional variational analysis: Label: en
49. Convergence of entropy-regularized natural policy gradient with linear function approximation: Label: en
50. Convergence analysis of a norm minimization-based convex vector optimization algorithm: Label: en