Pages that link to "Item:Q4401736"

The following pages link to The general quadratic optimization problem (Q4401736):

Displaying 20 items.

• An equivalence between two algorithms for general quadratic programming (Q580181) (← links)
• Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
• A polynomial-time test for M-matrices (Q805154) (← links)
• Criteria for copositive matrices (Q1079631) (← links)
• Testing the definiteness of matrices on polyhedral cones (Q1104045) (← links)
• Almost copositive matrices (Q1120638) (← links)
• Optimum design of plastic structures under displacement constraints (Q1152983) (← links)
• Almost definiteness of matrices on polyhedral cones (Q1183149) (← links)
• Determining subspaces on which a matrix is nonnegative definite (Q1189625) (← links)
• On the solution of large, structured linear complementarity problems: The tridiagonal case (Q1245772) (← links)
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems (Q1321811) (← links)
• A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming (Q1327826) (← links)
• Quadratic-programming criteria for copositive matrices (Q1823293) (← links)
• New variants of the criss-cross method for linearly constrained convex quadratic programming (Q1877024) (← links)
• Neural networks for computing in the elastoplastic analysis of structures (Q1892025) (← links)
• Static hedging of weather and price risks in electricity markets (Q2069163) (← links)
• The Boolean pivot operation, \(M\)-matrices, and reducible matrices (Q2365720) (← links)
• Block pivoting and shortcut strategies for detecting copositivity (Q2564929) (← links)
• Equivalence of some quadratic programming algorithms (Q3343781) (← links)
• A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)