Random algorithms for solving convex inequalities
From MaRDI portal
Publication:2768029
Recommendations
- Random algorithms for convex minimization problems
- Some randomized algorithms for convex quadratic programming
- A Randomized Algorithm to Optimize Over Certain Convex Sets
- Random convex programs
- A simple randomised algorithm for convex optimisation
- scientific article; zbMATH DE number 887432
- scientific article; zbMATH DE number 4139215
- Solving convex programs by random walks
- Randomized solutions to convex programs with multiple chance constraints
- Randomized Algorithms for Semi-Infinite Programming Problems
Cited in
(25)- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- On the finite convergence of a projected cutter method
- A finitely convergent circumcenter method for the convex feasibility problem
- Randomized algorithms for the separation of point sets and for solving quadratic programs
- Stochastic algorithms for exact and approximate feasibility of robust LMIs
- Finitely convergent iterative methods with overrelaxations revisited
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- A smooth inexact penalty reformulation of convex problems with linear constraints
- Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
- Jordan-algebraic aspects of optimization: randomization
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- A stochastic approximation method for convex programming with many semidefinite constraints
- A simple randomised algorithm for convex optimisation
- Random minibatch subgradient algorithms for convex problems with functional constraints
- Random algorithms for convex minimization problems
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
- Newton-type method for solving generalized inclusion
- Networked parallel algorithms for robust convex optimization via the scenario approach
- On subgradient projectors
- Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities.
- The MIN PFS problem and piecewise linear model estimation
- scientific article; zbMATH DE number 3961382 (Why is no real title available?)
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
This page was built for publication: Random algorithms for solving convex inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768029)
