Decomposition algorithm for convex differentiable minimization
From MaRDI portal
convex differentiable minimizationcoordinate descentdecomposition algorithmdual gradientgradient projectionseparable convex programmingsplitting algorithmtraffic assignmentvariational inequality
Variational inequalities (49J40) Decomposition methods (49M27) Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- An approximate decomposition algorithm for convex minimization
- scientific article; zbMATH DE number 1190656
- A decomposition algorithm for convex nondifferentiable minimization with errors
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- A Decomposition Method and Its Application to Convex Programming
- Decomposition algorithm for reverse convex programs
- A decomposition method for convex minimization problems and its application.
- scientific article; zbMATH DE number 1283857
- Path-following gradient-based decomposition algorithms for separable convex optimization
- Decomposition-aggregation method for convex programming problems
Cites work
- A scaled reduced gradient algorithm for network flow problems with convex separable costs
- An iterative scheme for variational inequalities
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Asymmetric variational inequality problems over product sets: Applications and iterative methods
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex Analysis
- Convex programming in Hilbert space
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Equilibria on a Congested Transportation Network
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 3293978 (Why is no real title available?)
- scientific article; zbMATH DE number 3368489 (Why is no real title available?)
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Monotone Operators and the Proximal Point Algorithm
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- On search directions for minimization algorithms
- On the convergence of sequential minimization algorithms
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Parallel optimization for traffic assignment
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
- Projection methods for variational inequalities with application to the traffic assignment problem
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Splitting Algorithms for the Sum of Two Nonlinear Operators
Cited in
(12)- On the convergence of the coordinate descent method for convex differentiable minimization
- A unified description of iterative algorithms for traffic equilibria
- A class of gap functions for variational inequalities
- Decomposition methods for differentiable optimization problems over Cartesian product sets
- A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- A convergent decomposition algorithm for support vector machines
- Globally convergent block-coordinate techniques for unconstrained optimization
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Block coordinate Dinkelbach algorithms for solving block-structured constrained fractional optimization problems
- An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
- An approximate decomposition algorithm for convex minimization
This page was built for publication: Decomposition algorithm for convex differentiable minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1176837)
