Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
From MaRDI portal
Publication:1214064
DOI10.1016/0021-9045(75)90067-2zbMath0297.41015OpenAlexW2029096605MaRDI QIDQ1214064
Publication date: 1975
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(75)90067-2
Related Items (12)
Strong convergence of projection-like methods in Hilbert spaces ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ A finitely convergent ``row-action method for the convex feasibility problem ⋮ On some optimization techniques in image reconstruction from projections ⋮ An interior points algorithm for the convex feasibility problem ⋮ Iterative solution of convex problems by fejer-monotone methods ⋮ Nondifferentiable symmetric and self duality in fractional programming. ⋮ Explicit duality for convex homogeneous programs ⋮ A general iterative scheme with applications to convex optimization and related fields ⋮ A class of programming problems whose objective function contains a norm ⋮ Relaxed outer projections, weighted averages and convex feasibility ⋮ Cyclic subgradient projections
Cites Work
- Unnamed Item
- Unnamed Item
- Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems
- Duality in Homogeneous Programming
- Minimization of unsmooth functionals
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
- AN APPLICATION OF THE METHOD OF STEEPEST DESCENTS TO THE SOLUTION OF SYSTEMS OF NON-LINEAR SIMULTANEOUS EQUATIONS
This page was built for publication: Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
