Pages that link to "Item:Q4302315"

The following pages link to On the Resolution of Linearly Constrained Convex Minimization Problems (Q4302315):

Displaying 15 items.

• Parallel algorithms for large-scale linearly constrained minimization problem (Q477497) (← links)
• On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem (Q1021668) (← links)
• A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
• An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← links)
• A trust region method for minimization of nonsmooth functions with linear constraints (Q1356054) (← links)
• Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds (Q1369047) (← links)
• Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization (Q1582578) (← links)
• On the solution of the extended linear complementarity problem (Q1808956) (← links)
• Solution of linear complementarity problems using minimization with simple bounds (Q1892604) (← links)
• On the solution of bounded and unbounded mixed complementarity problems (Q2767572) (← links)
• Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗ (Q4378111) (← links)
• A minimax method with application to the initial vector coding problem^* (Q4384040) (← links)
• On the regularization of mixed complementarity problems (Q4522533) (← links)
• PARALLEL MULTISPLITTINGS FOR CONSTRAINED OPTIMIZATION (Q4820167) (← links)
• A new strategy for solving variational inequalities in bounded polytopes^∗ (Q4845182) (← links)