The following pages link to (Q4039868):
Displaying 50 items.
- An MM Algorithm for Split Feasibility Problems (Q150985) (← links)
- Note on error bounds for linear complementarity problems for \(B\)-matrices (Q253929) (← links)
- An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844) (← links)
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems (Q268353) (← links)
- Topological fixed point theory and applications to variational inequalities (Q285883) (← links)
- Fundamentals of cone regression (Q289730) (← links)
- A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems (Q295360) (← links)
- SPN graphs: when copositive = SPN (Q314749) (← links)
- Feasibility problems with complementarity constraints (Q320869) (← links)
- Properties of some matrix classes based on principal pivot transform (Q338938) (← links)
- A multiobjective based approach for mathematical programs with linear flexible constraints (Q345535) (← links)
- A discrete element based simulation framework to investigate particulate spray deposition processes (Q349800) (← links)
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem (Q372849) (← links)
- On the optimal design of river fishways (Q400086) (← links)
- On solving linear complementarity problems by DC programming and DCA (Q409266) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495) (← links)
- Oops! I cannot do it again: testing for recursive feasibility in MPC (Q445103) (← links)
- Weakly chained diagonally dominant \(B\)-matrices and error bounds for linear complementarity problems (Q501964) (← links)
- A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems (Q503358) (← links)
- A general preconditioner for linear complementarity problem with an \(M\)-matrix (Q507968) (← links)
- Error bounds for linear complementarity problems of weakly chained diagonally dominant \(B\)-matrices (Q509965) (← links)
- New error bounds for linear complementarity problems of Nekrasov matrices and \(B\)-Nekrasov matrices (Q521916) (← links)
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems (Q535254) (← links)
- Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems (Q550095) (← links)
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
- The steepest descent gravitational method for linear programming (Q583105) (← links)
- A brief history of the international symposia on mathematical programming (Q607500) (← links)
- Numerical solutions of a two-phase membrane problem (Q610785) (← links)
- Efficient curve fitting: an application of multiobjective programming (Q614418) (← links)
- On singular \(N_{0}\)-matrices and the class \(Q\) (Q616416) (← links)
- \(P\)-matrices and signed digraphs (Q626772) (← links)
- IGAOR and multisplitting IGAOR methods for linear complementarity problems (Q631891) (← links)
- A projected-gradient interior-point algorithm for complementarity problems (Q634730) (← links)
- A matrix-free cone complementarity approach for solving large-scale, nonsmooth, rigid body dynamics (Q645519) (← links)
- On the natural merit function for solving complementarity problems (Q647391) (← links)
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem (Q670858) (← links)
- Incremental constraint deletion in systems of linear constraints (Q672413) (← links)
- Constructive characterization of Lipschitzian \(Q_ 0\)-matrices (Q676035) (← links)
- On a global projection-type error bound for the linear complementarity problem (Q677141) (← links)
- New error bounds for the linear complementarity problem of \(QN\)-matrices (Q679712) (← links)
- An alternative error bound for linear complementarity problems involving \(B^{S}\)-matrices (Q681501) (← links)
- Issues in computing contact forces for non-penetrating rigid bodies (Q686750) (← links)
- Exterior point algorithms for nearest points and convex quadratic programs (Q687081) (← links)
- A long-step barrier method for convex quadratic programming (Q689102) (← links)
- A note on solvability of a class of linear complementarity problems (Q689125) (← links)
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio (Q689144) (← links)
- The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
