Stochastic optimization under hidden convexity
From MaRDI portal
Cites work
- A proximal method for composite minimization
- A Stochastic Approximation Method
- A survey of hidden convex optimization
- A tutorial on geometric programming
- Acceleration of Stochastic Approximation by Averaging
- An inverse function theorem converse
- Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Cubic regularization of Newton method and its global performance
- Efficiency of minimizing compositions of convex functions and smooth maps
- Efficient algorithms for a class of stochastic hidden convex optimization and its applications in network revenue management
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Fast convergence to non-isolated minima: four equivalent conditions for \({\mathrm{C}^2}\) functions
- Faster algorithm and sharper analysis for constrained Markov decision process
- First-order and stochastic optimization methods for machine learning
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Geometric Programming: Methods, Computations and Applications
- Global Convergence of Policy Gradient Primal–Dual Methods for Risk-Constrained LQRs
- Hadamard inverse function theorem proved by variational analysis
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 1765103 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Lectures on convex optimization
- Linear Matrix Inequalities in System and Control Theory
- Lower bounds for non-convex stochastic optimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Multidimensional Stochastic Approximation Methods
- Numerical Optimization
- On a Stochastic Approximation Method
- On Nesterov's nonsmooth Chebyshev-Rosenbrock functions
- On Nesterov's smooth Chebyshev-Rosenbrock function
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the last iterate convergence of momentum methods
- Optimization methods for large-scale machine learning
- Optimizing static linear feedback: gradient method
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Second-order Sufficiency and Quadratic Growth for Nonisolated Minima
- Some methods of speeding up the convergence of iteration methods
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Stochastic Estimation of the Maximum of a Regression Function
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic model-based minimization of weakly convex functions
- Supply and demand functions in inventory models
- The effect of smooth parametrizations on nonconvex optimization landscapes
This page was built for publication: Stochastic optimization under hidden convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6893461)
