Single-projection procedure for linear optimization
From MaRDI portal
(Redirected from Publication:330507)
Recommendations
Cites work
- A finite steps algorithm for solving convex feasibility problems
- A New Projection Method for Variational Inequality Problems
- A review of recent advances in global optimization
- Convergence of suitable affine subspace method for finding the least distance to a simplex
- Finding the nearest point in A polytope
- How good are extrapolated bi-projection methods for linear feasibility problems?
- How good are projection methods for convex feasibility problems?
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3672004 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- Linearization method of global optimization for generalized geometric programming
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Projected gradient methods for linearly constrained problems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Simplicial decomposition in nonlinear programming algorithms
- Some recent advances in projection-type methods for variational inequalities
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
Cited in
(10)- Projecting onto rectangular matrices with prescribed row and column sums
- Linear updates for a single-phase projective method
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Can linear superiorization be useful for linear optimization problems?
- scientific article; zbMATH DE number 7656030 (Why is no real title available?)
- A bicomposition of conical projections
- Row-Oriented Decomposition in Large-Scale Linear Optimization
- Single-projection procedure for infinite dimensional convex optimization problems
- Equivalence relations in convex optimization
- Linear optimization by conical projection
This page was built for publication: Single-projection procedure for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330507)
