Normal solutions of linear programs
From MaRDI portal
Recommendations
- Search for normal solutions in linear programming problems
- Finding normal solutions in piecewise linear programming
- Regularization and normal solutions of systems of linear equations and inequalities
- scientific article; zbMATH DE number 2196286
- Normal solvability of linear elliptic problems
- An algorithm for finding normal solutions of consistent systems of linear equations
- On the minimum norm solution of linear programs
- Normal solvability of general linear elliptic problems
- Résolution de programmes linéaires entiers ou mixtes à l'aide de la forme normale de Hermite
- Exact solutions to linear programming problems
Cited in
(30)- Monotonicity in quadratically regularized linear programs
- An efficient algorithm for the _p norm based metric nearness problem
- Quantitative convergence of quadratically regularized linear programs
- Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
- Insoluble multicriteria linear programming problems
- A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs
- A new result in the theory and computation of the least-norm solution of a linear program
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- Algorithms for bound constrained quadratic programming problems
- Finite termination of the proximal point algorithm
- Piecewise-linear pathways to the optimal solution set in linear programming
- Search for normal solutions in linear programming problems
- Iterative schemes for the least 2-norm solution of piecewise linear programs
- Linear programming with nonparametric penalty programs and iterated thresholding
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
- A global error bound for quadratic perturbation of linear programs
- Finite perturbation of convex programs
- A finite algorithm for the least two-norm solution of a linear program1
- A Gauss-Newton method for convex composite optimization
- Finding normal solutions in piecewise linear programming
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- A conjugate gradient algorithm for sparse linear inequalities
- A Newton method for linear programming
- scientific article; zbMATH DE number 6160116 (Why is no real title available?)
- A nonlinear equation for linear programming
- Metric-Constrained Optimization for Graph Clustering Algorithms
- An efficient CGA\_ADMM for the metric nearness problem
- Introduction: New approaches to linear programming
- Newton's method for linear inequality systems
- On the minimum norm solution of linear programs
This page was built for publication: Normal solutions of linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716811)
