Descent methods for convex essentially smooth minimization
From MaRDI portal
Publication:1321119
DOI10.1007/BF00941397zbMath0793.90050MaRDI QIDQ1321119
Publication date: 27 April 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
quadratic programmingcoordinate descentmonotropic programmingdual of linearly constrained convex programsdual rectification algorithmentropy programming
Related Items
A unified approach to error bounds for structured convex optimization problems, An almost cyclic 2-coordinate descent method for singly linearly constrained problems, A survey on the continuous nonlinear resource allocation problem, Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization of Burg's entropy over linear constraints
- A new polynomial-time algorithm for linear programming
- Relaxation methods for monotropic programs
- Vector and parallel computing for matrix balancing
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Solution of symmetric linear complementarity problems by iterative methods
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Bounds for error in the solution set of a perturbed linear program
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- A Comparative Study of Algorithms for Matrix Balancing
- Optimization of “$\log x$” Entropy over Linear Equality Constraints
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Convex Analysis
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- An algorithm for computing the capacity of arbitrary discrete memoryless channels
- Computation of channel capacity and rate-distortion functions
- Generalized Iterative Scaling for Log-Linear Models
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- On the convergence of sequential minimization algorithms
