Single-projection procedure for linear optimization
From MaRDI portal
Publication:330507
DOI10.1007/s10898-015-0337-9zbMath1349.90608OpenAlexW1059615832MaRDI QIDQ330507
Publication date: 26 October 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0337-9
Related Items
Projecting onto rectangular matrices with prescribed row and column sums, Can linear superiorization be useful for linear optimization problems?, A bicomposition of conical projections, Unnamed Item, Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- How good are extrapolated bi-projection methods for linear feasibility problems?
- A review of recent advances in global optimization
- 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
- Linearization method of global optimization for generalized geometric programming
- Some recent advances in projection-type methods for variational inequalities
- How good are projection methods for convex feasibility problems?
- A finite steps algorithm for solving convex feasibility problems
- Projected gradient methods for linearly constrained problems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Finding the nearest point in A polytope
- Simplicial decomposition in nonlinear programming algorithms
- A New Projection Method for Variational Inequality Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
