Pages that link to "Item:Q4194741"

The following pages link to A stable method for solving certain constrained least squares problems (Q4194741):

Displaying 15 items.

• A numerically stable dual method for solving strictly convex quadratic programs (Q59165) (← links)
• Parallel bundle-based decomposition for large-scale structured mathematical programming problems (Q751515) (← links)
• Solving the minimal least squares problem subject to bounds on the variables (Q797970) (← links)
• A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\) (Q1061617) (← links)
• Numerical study of some feasible direction methods in mathematical programming (Q1165559) (← links)
• Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs (Q1338136) (← links)
• Separating plane algorithms for convex optimization (Q1356051) (← links)
• Partitioning mathematical programs for parallel solution (Q1380936) (← links)
• Algorithms for the solution of stochastic dynamic minimax problems (Q1908531) (← links)
• Procedures for optimization problems with a mixture of bounds and general linear constraints (Q3675917) (← links)
• A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
• An active set method for solving linearly constrained nonsmooth optimization problems (Q3783077) (← links)
• An algorithm for linear least squares problems with equality and nonnegativity constraints (Q3911670) (← links)
• An algorithm for least distance programming (Q3920551) (← links)
• ε-Optimal solutions in nondifferentiable convex programming and some related questions (Q3959749) (← links)