Pages that link to "Item:Q5827281"
From MaRDI portal
The following pages link to The Relaxation Method for Linear Inequalities (Q5827281):
Displaying 50 items.
- Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point (Q261538) (← links)
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- Single-projection procedure for linear optimization (Q330507) (← links)
- Multicriterial multi-index resource scheduling problems (Q367976) (← links)
- Strong convergence of the mann iteration for -demicontractive mappings (Q409941) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Modified Newton-type processes generating Fejér approximations of regularized solutions to nonlinear equations (Q483417) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems (Q582015) (← links)
- Partial inverse of a monotone operator (Q585088) (← links)
- Multiindex optimal production planning problems (Q612224) (← links)
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- Training spatially homogeneous fully recurrent neural networks in eigenvalue space. (Q676596) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- A row relaxation method for large minimax problems (Q688632) (← links)
- A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
- Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
- A strongly polynomial algorithm for linear systems having a binary solution (Q715067) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Iterative processes of Fejér type in ill-posed problems with a priori information (Q735926) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- A polynomial projection algorithm for linear feasibility problems (Q747780) (← links)
- On the convergence properties of Hildreth's quadratic programming algorithm (Q749443) (← links)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- Linear dynamic approximation theory (Q755065) (← links)
- Minimax forecasting model in the control system with identifier (Q885719) (← links)
- The equity constrained shortest path problem (Q910348) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- Coverage processes on spheres and condition numbers for linear programming (Q964778) (← links)
- Iterative methods for the computation of fixed points of demicontractive mappings (Q966099) (← links)
- On the regularity condition in a convex feasibility problem (Q1001865) (← links)
- A primal-dual projection method for solving systems of linear inequalities (Q1058270) (← links)
- An automatic relaxation method for solving interval linear inequalities (Q1060533) (← links)
- Strong convergence of projection-like methods in Hilbert spaces (Q1089908) (← links)
- An LP-based successive overrelaxation method for linear complementarity problems (Q1093555) (← links)
- A computational solution of the inverse problem in radiation-therapy treatment planning (Q1098573) (← 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)
- Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- On relaxation methods for systems of linear inequalities (Q1159953) (← links)
- New methods for linear inequalities (Q1162118) (← links)
- An interior points algorithm for the convex feasibility problem (Q1166775) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- Orthogonalizing linear operators in convex programming. I, II (Q1280891) (← links)
- Arbitrary-norm separating plane (Q1306363) (← links)
- On the convergence of von Neumann's alternating projection algorithm for two sets (Q1308949) (← links)
