A dual exact penalty formulation for the linear complementarity problem (Q1093553): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual differentiable exact penalty function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of symmetric linear complementarity problems by iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Linear Complementarity Problem in Circuit Simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple bounds for solutions of monotone complementarity problems and convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00939395 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981276670 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:52, 30 July 2024

scientific article
Language Label Description Also known as
English
A dual exact penalty formulation for the linear complementarity problem
scientific article

    Statements

    A dual exact penalty formulation for the linear complementarity problem (English)
    0 references
    0 references
    1988
    0 references
    We consider a dual exact penalty formulation for the monotone linear complementarity problem. Tihonov regularization is then used to reduce the solution of the problem to the solution of a sequence of positive- definite, symmetric quadratic programs. A modified form of an SOR method due to Mangasarian is proposed to solve these quadratic programs. We also indicate how to obtain approximation solutions to predefined tolerance by solving a single quadratic program, in special cases.
    0 references
    successive overrelaxation methods
    0 references
    dual exact penalty formulation
    0 references
    monotone linear complementarity
    0 references
    Tihonov regularization
    0 references
    approximation solutions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references