Pages that link to "Item:Q2089792"
From MaRDI portal
The following pages link to A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792):
Displaying 10 items.
- A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
- An algorithm for solving sparse nonlinear least squares problems (Q1822462) (← links)
- A greedy Newton-type method for multiple sparse constraint problem (Q2696970) (← links)
- Solving Large Sparse Nonlinear Programs Using GRG (Q3993662) (← links)
- Greedy Gauss-Newton algorithms for finding sparse solutions to nonlinear underdetermined systems of equations (Q5356917) (← links)
- Sparse nonnegative solution of underdetermined linear equations by linear programming (Q5385846) (← links)
- Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds (Q6116233) (← links)
- Penalty method for the sparse portfolio optimization problem (Q6574067) (← links)
- A Lagrange–Newton algorithm for tensor sparse principal component analysis (Q6611219) (← links)
- The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results (Q6667692) (← links)
