Pages that link to "Item:Q4578978"
From MaRDI portal
The following pages link to Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems (Q4578978):
Displaying 25 items.
- An incremental decomposition method for unconstrained optimization (Q272371) (← links)
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks (Q301668) (← links)
- Iteration complexity analysis of block coordinate descent methods (Q526831) (← links)
- Non-cooperative games with minmax objectives (Q742296) (← links)
- An adaptive partial linearization method for optimization problems on product sets (Q1686667) (← links)
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks (Q1694193) (← links)
- On the pervasiveness of difference-convexity in optimization and statistics (Q1739035) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- Variational inequality type formulations of general market equilibrium problems with local information (Q2031949) (← links)
- Randomness and permutations in coordinate descent methods (Q2189444) (← links)
- Asynchronous parallel algorithms for nonconvex optimization (Q2205974) (← links)
- Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
- Distributed semi-supervised support vector machines (Q2418194) (← links)
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization (Q2425169) (← links)
- Distributed nonconvex constrained optimization over time-varying digraphs (Q2425183) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization (Q3387904) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- Decentralized multi-agent optimization based on a penalty method (Q5055302) (← links)
- Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case (Q5058371) (← links)
- Inexact partial linearization methods for network equilibrium problems (Q5090144) (← links)
- Decentralized Dictionary Learning Over Time-Varying Digraphs (Q5214231) (← links)
- Adaptive online distributed optimization in dynamic environments (Q5865329) (← links)
- On the gradient method for solving multi-agent systems (Q6187998) (← links)
- Open issues and recent advances in DC programming and DCA (Q6200375) (← links)
