Pages that link to "Item:Q1411463"

The following pages link to On the minimum norm solution of linear programs (Q1411463):

Displaying 38 items.

• Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming (Q364501) (← links)
• Experience in organizing hybrid parallel calculations in the Evtushenko-Golikov method for problems with block-angular structure (Q463364) (← links)
• A first order method for finding minimal norm-like solutions of convex optimization problems (Q463716) (← links)
• Generalized Newton method for linear optimization problems with inequality constraints (Q483411) (← links)
• Regularization and normal solutions of systems of linear equations and inequalities (Q492280) (← links)
• Some techniques for solving absolute value equations (Q668177) (← links)
• A Newton method for linear programming (Q704747) (← links)
• Finding the projection of a given point on the set of solutions of a linear programming problem (Q735648) (← links)
• A new result in the theory and computation of the least-norm solution of a linear program (Q1091260) (← links)
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
• The noncooperative transportation problem and linear generalized Nash games (Q1754116) (← links)
• Superlinear convergence of a Newton-type algorithm for monotone equations (Q1781869) (← links)
• Minimum norm solution to the absolute value equation in the convex case (Q1937019) (← links)
• On the optimal correction of infeasible systems of linear inequalities (Q2046550) (← links)
• Revisiting the minimum-norm problem (Q2129110) (← links)
• Projection-based local and global Lipschitz moduli of the optimal value in linear programming (Q2139256) (← links)
• Matrix corrections minimal with respect to the Euclidean norm for linear programming problems (Q2261705) (← links)
• An explicit parallel algorithm for solving variational inclusion problem and fixed point problem in Banach spaces (Q2287437) (← links)
• Computing minimum norm solution of linear systems of equations by the generalized Newton method (Q2360228) (← links)
• On the solution set of convex problems and its numerical application (Q2370584) (← links)
• Regularity and well-posedness of a dual program for convex best \(C^{1}\)-spline interpolation (Q2385542) (← links)
• On an inverse linear programming problem (Q2396367) (← links)
• A note on solving MINLP's using formulation space search (Q2448189) (← links)
• A strongly convergent proximal bundle method for convex minimization in Hilbert spaces (Q2790873) (← links)
• Tikhonov regularization for infeasible absolute value equations (Q2817229) (← links)
• Computing minimum norm solution of a specific constrained convex nonlinear problem (Q2893937) (← links)
• A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs (Q3648621) (← links)
• Normal solutions of linear programs (Q3716811) (← links)
• A replica analysis of the minimum weight solution to the linear equations problem (Q4785297) (← links)
• (Q4917841) (← links)
• (Q4952722) (← links)
• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming (Q5124003) (← links)
• Minimum norm solution to the positive semidefinite linear complementarity problem (Q5413890) (← links)
• (Q5461151) (← links)
• Augmented Lagrangian method for large-scale linear programming problems (Q5717539) (← links)
• Multicategory proximal support vector machine classifiers (Q5916203) (← links)
• Multicategory proximal support vector machine classifiers (Q5921686) (← links)
• (Q6098205) (← links)