Pages that link to "Item:Q2768029"

The following pages link to Random algorithms for solving convex inequalities (Q2768029):

Displaying 22 items.

• A simple randomised algorithm for convex optimisation (Q463726) (← links)
• Random algorithms for convex minimization problems (Q644912) (← links)
• Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities (Q875498) (← links)
• The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
• Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. (Q1421455) (← links)
• Randomized algorithms for the separation of point sets and for solving quadratic programs (Q1895800) (← links)
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
• Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
• Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems (Q2149580) (← links)
• Finitely convergent iterative methods with overrelaxations revisited (Q2239369) (← links)
• Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
• On the finite convergence of a projected cutter method (Q2349845) (← links)
• Newton-type method for solving generalized inclusion (Q2665946) (← links)
• Jordan-algebraic aspects of optimization: randomization (Q3161141) (← links)
• Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach (Q4625791) (← links)
• A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
• Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities (Q5219716) (← links)
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
• On Subgradient Projectors (Q5255001) (← links)
• A stochastic approximation method for convex programming with many semidefinite constraints (Q5882223) (← links)
• A finitely convergent circumcenter method for the convex feasibility problem (Q6579996) (← links)