scientific article; zbMATH DE number 3876932

MaRDI QIDQ3342220zbMATH OpenFDO

Authors A. Auslender

Publication date 1984

zbMATH Keywords

compact polyhedral domainlinearly constrained minimizationsimplex- like solution method

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A three-step method of linearization for minimization problems
• A constraint linearization method for nondifferentiable convex minimization
• Methods of unconditional minimization of functions using a simplex
• A method of linearizations for linearly constrained nonconvex nonsmooth minimization
• An algorithm for linearly constrained convex nondifferentiable minimization problems

Cited in

(8)

• Reference variable methods of solving min-Max optimization problems
• Extension of unconstrained minimization methods to linearly constrained problems
• scientific article; zbMATH DE number 5669891 (Why is no real title available?)
• scientific article; zbMATH DE number 3936945 (Why is no real title available?)
• Optimization for exaust emission problems by the simplex method
• scientific article; zbMATH DE number 1152965 (Why is no real title available?)
• Pattern Search Methods for Linearly Constrained Minimization
• The Method of Pairwise Variations with Tolerances for Linearly Constrained Optimization Problems

This page was built for publication:

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