Analysis of a quadratic programming decomposition algorithm

DOI10.1137/070701728MaRDI QIDQ3069084zbMATH OpenOpenAlexFDO

Authors Guy Bencteux, É. Cancès, William Hager, Claude Le Bris

Publication date 24 January 2011

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/070701728

zbMATH Keywords

quadratic programmingdomain decomposition methodorthogonality constraintselectronic structure calculations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Recommendations

• Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
• Separable spherical constraints and the decrease of a quadratic function in the gradient projection step
• A decomposition method for global and local quadratic minimization
• Global optimization of a quadratic functional with quadratic equality constraints
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint

Cited in

(7)

• scientific article; zbMATH DE number 1369462 (Why is no real title available?)
• A decomposition algorithm for solving large-scale quadratic programming problems
• A scalable two-level domain decomposition eigensolver for periodic Schrödinger eigenstates in anisotropically expanding domains
• A feasible method for optimization with orthogonality constraints
• First-hit analysis of algorithms for computing quadratic irregularity
• A decomposition method for quadratic programming
• A randomized feasible algorithm for optimization with orthogonal constraints

Describes a project that uses

Uses Software

• NAPACK

This page was built for publication: Analysis of a quadratic programming decomposition algorithm

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