Pages that link to "Item:Q704747"

The following pages link to A Newton method for linear programming (Q704747):

Displaying 33 items.

• An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side (Q356073) (← links)
• Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming (Q364501) (← links)
• Solving the general quadratic programming problem in a finite number of steps (Q382174) (← links)
• A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← 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)
• Semilocal convergence analysis of \(S\)-iteration process of Newton-Kantorovich like in Banach spaces (Q511962) (← links)
• Augmented Lagrangian method within L-shaped method for stochastic linear programs (Q669327) (← links)
• Finding the projection of a given point on the set of solutions of a linear programming problem (Q735648) (← links)
• Zonotopes and the LP-Newton method (Q833464) (← links)
• Projective-dual method for solving systems of linear equations with nonnegative variables (Q1644007) (← links)
• A fast eigenvalue approach for solving the trust region subproblem with an additional linear inequality (Q1655381) (← links)
• Minimum norm solution to the absolute value equation in the convex case (Q1937019) (← links)
• A nonmonotone PRP conjugate gradient method for solving square and under-determined systems of equations (Q2013818) (← links)
• Optimal correction of the absolute value equations (Q2022323) (← links)
• On the optimal correction of infeasible systems of linear inequalities (Q2046550) (← links)
• Newton-type method for solving systems of linear equations and inequalities (Q2206388) (← links)
• Locally polynomial method for solving systems of linear inequalities (Q2206481) (← links)
• Solution of a contact elasticity problem with a rigid inclusion (Q2332654) (← links)
• Computing minimum norm solution of linear systems of equations by the generalized Newton method (Q2360228) (← links)
• On an inverse linear programming problem (Q2396367) (← links)
• (Q2893937) (← links)
• An interior-point algorithm for solving inverse linear optimization problem (Q2903128) (← links)
• A high-order path-following method for projection onto the primal-dual optimal solution set of linear programs (Q3648621) (← links)
• (Q4917841) (← links)
• Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs (Q5005870) (← links)
• Inexact Newton Method for Minimization of Convex Piecewise Quadratic Functions (Q5114894) (← 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)
• Augmented Lagrangian method for large-scale linear programming problems (Q5717539) (← links)
• Linear programming with nonparametric penalty programs and iterated thresholding (Q5882227) (← links)
• Newton-based approach to solving K-SVCR and twin-KSVC multi-class classification in the primal space (Q6068698) (← links)
• New numerical methods and some applied aspects of the p-regularity theory (Q6200625) (← links)