Pages that link to "Item:Q1337633"
From MaRDI portal
The following pages link to An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633):
Displaying 10 items.
- On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem (Q1021668) (← links)
- New constrained optimization reformulation of complementarity problems (Q1264991) (← links)
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- Solution of monotone complementarity problems with locally Lipschitzian functions (Q1356058) (← links)
- Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization (Q1582578) (← links)
- A neural network for the linear complementarity problem (Q1596888) (← links)
- On the resolution of monotone complementarity problems (Q1815077) (← links)
- A descent method for a reformulation of the second-order cone complementarity problem (Q2479359) (← links)
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem (Q2576724) (← links)
- PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION (Q4820167) (← links)
