Pages that link to "Item:Q1214064"

The following pages link to 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 (Q1214064):

Displaying 12 items.

• Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
• Strong convergence of projection-like methods in Hilbert spaces (Q1089908) (← links)
• A finitely convergent ``row-action'' method for the convex feasibility problem (Q1109529) (← links)
• On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
• An interior points algorithm for the convex feasibility problem (Q1166775) (← links)
• A class of programming problems whose objective function contains a norm (Q1254496) (← links)
• Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
• Nondifferentiable symmetric and self duality in fractional programming. (Q2467865) (← links)
• A general iterative scheme with applications to convex optimization and related fields (Q3361812) (← links)
• Cyclic subgradient projections (Q3953572) (← links)
• Explicit duality for convex homogeneous programs (Q4116258) (← links)
• Iterative solution of convex problems by fejer-monotone methods (Q4883639) (← links)