scientific article; zbMATH DE number 3876932
[For the entire collection see Zbl 0536.00020.] Consider the problem: (1) minimize \(\{\) f(x)\(| x\in P\}\), where P is a nonempty compact polyhedral set of \({\mathbb{R}}^ n\) and \(f:{\mathbb{R}}^ n\to {\mathbb{R}}^ 1\) a continuously differentiable function. For solving (1), the author presents a simplex-like method M. Indeed, in case of f being linear, M becomes the simplex method. If \(f(x)=\| x\|^ 2\) it behaves much the same as the algorithm by Bazaraa, Goode, and Rardin; while for a general function it is strictly related to the convex simplex method by Zangwill. The case of degeneracy on the vertices is also considered.
- 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
- 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)