The following pages link to (Q4001523):
Displaying 50 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- A method of bi-coordinate variations with tolerances and its convergence (Q268944) (← links)
- An incremental decomposition method for unconstrained optimization (Q272371) (← links)
- A generalized forward-backward splitting method for solving quasi inclusion problems in Banach spaces (Q281480) (← links)
- Extended Lorentz cones and variational inequalities on cylinders (Q283915) (← links)
- Simultaneous routing and flow rate optimization in energy-aware computer networks (Q285426) (← links)
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
- Distributed synthesis and stability of cooperative distributed model predictive control for linear systems (Q286260) (← links)
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems (Q286313) (← links)
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem (Q293116) (← links)
- A game-theoretic approach to computation offloading in mobile cloud computing (Q301661) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Selective bi-coordinate variations for resource allocation type problems (Q301690) (← links)
- A parallel implementation of an \(O^\ast(n^4)\) volume algorithm (Q302146) (← links)
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- Master problem approximations in Dantzig-Wolfe decomposition of variational inequality problems with applications to two energy market models (Q336613) (← links)
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules (Q345532) (← links)
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
- Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures (Q361272) (← links)
- On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities (Q371479) (← links)
- Q-learning and policy iteration algorithms for stochastic shortest path problems (Q378731) (← links)
- A parallel splitting method for separable convex programs (Q382899) (← links)
- An improved method for solving multiple-sets split feasibility problem (Q385702) (← links)
- On the performance of a retransmission-based synchronizer (Q392190) (← links)
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
- A class of distributed optimization methods with event-triggered communication (Q404510) (← links)
- Finding solutions of implicit complementarity problems by isotonicity of the metric projection (Q412701) (← links)
- Limit dynamics for stochastic models of data exchange in parallel computation networks (Q415676) (← links)
- Parallel asynchronous iterations for the solution of a 3D continuous flow electrophoresis problem (Q416613) (← links)
- An improved two-step method for solving generalized Nash equilibrium problems (Q421788) (← links)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods (Q429465) (← links)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments (Q429466) (← links)
- Dual decomposition method for optimal and fair congestion control in ad hoc networks: algorithm, implementation and evaluation (Q436836) (← links)
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (Q447556) (← links)
- Continuous-time consensus with discrete-time communications (Q450829) (← links)
- Common solutions to variational inequalities (Q452274) (← links)
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures (Q453611) (← links)
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators (Q461439) (← links)
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems (Q463005) (← links)
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization (Q467471) (← links)
- Clock synchronization in symmetric stochastic networks (Q475088) (← links)
- Parallel algorithms for large-scale linearly constrained minimization problem (Q477497) (← links)
- Dobrushin's ergodicity coefficient for Markov operators on cones (Q487212) (← links)
- mReno: a practical multipath congestion control for communication networks (Q488647) (← links)
- Consensus proximal support vector machine for classification problems with sparse solutions (Q489099) (← links)
- Decentralised minimum-time consensus (Q490557) (← links)
- A relaxed projection method for split variational inequalities (Q493247) (← links)
- An augmented Lagrangian method for distributed optimization (Q494348) (← links)
- A parallel quadratic programming method for dynamic optimization problems (Q499159) (← links)
