scientific article
From MaRDI portal
Publication:2768029
zbMath0997.90053MaRDI QIDQ2768029
Publication date: 18 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear matrix inequalitiesnumerical simulationconvex feasibility problemrandom subgradient methodsimple iterative methods
Related Items (18)
A stochastic approximation method for convex programming with many semidefinite constraints ⋮ Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ The MIN PFS problem and piecewise linear model estimation ⋮ Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems ⋮ Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities ⋮ Newton-type method for solving generalized inclusion ⋮ Random algorithms for convex minimization problems ⋮ Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. ⋮ Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach ⋮ A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints ⋮ Finitely convergent iterative methods with overrelaxations revisited ⋮ Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities ⋮ Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates ⋮ Random minibatch subgradient algorithms for convex problems with functional constraints ⋮ On Subgradient Projectors ⋮ On the finite convergence of a projected cutter method
This page was built for publication:
