Convex programs with an additional reverse convex constraint (Q1071651): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Iterative Solution of Nonlinear Optimal Control Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary Geometric Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Validity of a Family of Optimization Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of local solutions for a class of nonconvex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programs with an additional reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a concave function subject to mixed linear and reverse convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of continuous convex functional on complements of convex subsets of locally convex spaces<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922491 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for globally minimizing concave functions over convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for nonconvex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximation method for globally minimizing a concave function over a compact convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On outer approximation methods for solving concave minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a concave function over a compact convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank
 
Normal rank

Revision as of 11:55, 17 June 2024

scientific article
Language Label Description Also known as
English
Convex programs with an additional reverse convex constraint
scientific article

    Statements

    Convex programs with an additional reverse convex constraint (English)
    0 references
    0 references
    1987
    0 references
    A method is presented for solving a class of global optimization problems of the form (P): minimize \(f(x)\), subject to \(x\in D\), \(g(x)\geq 0\), where D is a closed convex subset of \(R^ n\) and f, g are convex finite functions on \(R^ n\). Under suitable stability hypotheses, it is shown that a feasible point \(\bar x\) is optimal if and only if \(0=\max \{g(x):\) \(x\in D\), \(f(\bar x)\leq f(x)\}\). On the basis of this optimality criterion, the problem is reduced to a sequence of subproblems \(Q_ k\), \(k=1,2,...\), each of which consists in maximizing the convex function \(g(x)\) over some polyhedron \(S_ k\). The method is similar to the outer approximation method for maximizing a convex function over a compact convex set.
    0 references
    global optimization
    0 references
    sequence of subproblems
    0 references
    outer approximation
    0 references
    reverse convex constraints
    0 references
    closed convex domain
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references