A decomposition method for structured quadratic programming problems

DOI10.1016/S0022-0000(67)80018-7MaRDI QIDQ2527600zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1967

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0022-0000(67)80018-7

zbMATH Keywords

operations research

Cites work

• scientific article; zbMATH DE number 3353070 (Why is no real title available?)
• scientific article; zbMATH DE number 3359958 (Why is no real title available?)
• scientific article; zbMATH DE number 3365064 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• Decomposition Principle for Linear Programs
• Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme
• Partitioning procedures for solving mixed-variables programming problems
• Primal partition programming for block diagonal matrices
• Stationary points of quadratic maximum-problems

Cited in

(3)

• A projective method for structured nonlinear programs
• AN INTERACTIVE FUZZY SATISFICING METHOD FOR MULTIOBJECTIVE LINEAR FRACTIONAL PROGRAMS WITH BLOCK ANGULAR STRUCTURE
• A decomposition method for structured linear and nonlinear programs

This page was built for publication: A decomposition method for structured quadratic programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2527600)