Minimizing pseudoconvex functions on convex compact sets (Q1120481): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Efficient Computational Procedure for a Generalized Quadratic Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm to maximize certain pseudoconcave functions on polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rate of convergence of certain methods of centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the design of linear multivariable feedback systems via constrained nondifferentiable optimization in H/sup infinity / spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank

Latest revision as of 14:21, 19 June 2024

scientific article
Language Label Description Also known as
English
Minimizing pseudoconvex functions on convex compact sets
scientific article

    Statements

    Minimizing pseudoconvex functions on convex compact sets (English)
    0 references
    0 references
    0 references
    1990
    0 references
    An algorithm is presented which minimizes continuously differentiable pseudo-convex functions on convex compact sets which are characterized by their support functions. If the function can be minimized exactly on affine sets in a finite number of operations and the constraints set is a polytope, the algorithm has finite convergence. Numerical results are reported which illustrate the performance of the algorithm when applied to a specific search direction problem. The algorithm differs from existing algorithms in that it has proven convergence when applied to any convex compact set, and not just polytopal sets.
    0 references
    barycentric representation
    0 references
    continuously differentiable pseudo-convex functions
    0 references
    convex compact sets
    0 references
    finite convergence
    0 references
    search direction problem
    0 references

    Identifiers