Minimization of nonlinear functions with linear constraints

DOI10.1134/S1995423913030038MaRDI QIDQ5407762zbMATH OpenFDO

Authors G. I. Zabinyako, E. A. Kotel'nikov

Publication date 7 April 2014

Published in Numerical Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1995423913030038

zbMATH Keywords

nonlinear programmingbasisquasi-Newton methodsubgradient methodreduced gradientsuperbasismethod of conjugate gradients

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Recommendations

• A modular system of algorithms for unconstrained minimization
• scientific article; zbMATH DE number 4204123
• scientific article; zbMATH DE number 16326
• A method of linearizations for linearly constrained nonconvex nonsmooth minimization
• scientific article; zbMATH DE number 4053360

Cited in

(5)

• A modular system of algorithms for unconstrained minimization
• Linearly constrained global minimization of functions with concave minorants
• scientific article; zbMATH DE number 3896690 (Why is no real title available?)
• scientific article; zbMATH DE number 3197277 (Why is no real title available?)
• Add-in for solvers of unconstrained minimization to eliminate lower bounds of variables by transformation

Describes a project that uses

Uses Software

• METIS
• PARDISO
• SuperLU-DIST

This page was built for publication: Minimization of nonlinear functions with linear constraints

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