Relaxation methods for problems with strictly convex separable costs and linear constraints
From MaRDI portal
(Redirected from Publication:3777809)
Recommendations
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Relaxation methods for monotropic programs
- Relaxation methods for strictly convex regularizations of piecewise linear programs
Cites work
- Convex Analysis
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3951877 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- Note—A Note on the Cyclic Coordinate Ascent Method
- On search directions for minimization algorithms
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
- On the convergence of sequential minimization algorithms
- Relaxation Methods for Linear Programs
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
Cited in
(29)- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Decomposition algorithm for convex differentiable minimization
- Relaxation methods for strictly convex regularizations of piecewise linear programs
- Descent methods for convex essentially smooth minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- How to deal with the unbounded in optimization: Theory and algorithms
- The relaxation method for certain type of pseudoconvex programming problems
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Calibration estimation of semiparametric copula models with data missing at random
- PERT and crashing revisited: Mathematical generalizations
- Dual coordinate ascent methods for non-strictly convex minimization
- A survey on the continuous nonlinear resource allocation problem
- Strong convergence of alternating projections
- Blending learning and inference in conditional random fields
- scientific article; zbMATH DE number 5669891 (Why is no real title available?)
- scientific article; zbMATH DE number 27284 (Why is no real title available?)
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- On the linear convergence of the alternating direction method of multipliers
- Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
- Finite convergence of a subgradient projections method with expanding controls
- Causal effect estimation for multivariate continuous treatments
- Hilbertian convex feasibility problem: Convergence of projection methods
- Applying the progressive hedging algorithm to stochastic generalized networks
- Relaxation methods for monotropic programs
- Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem
- A survey of dynamic network flows
This page was built for publication: Relaxation methods for problems with strictly convex separable costs and linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777809)
