Inscribed ball and enclosing box methods for the convex maximization problem (Q5963240): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-015-0981-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2268284962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient global optimality conditions for convex maximization revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for maximizing a convex function over a simple set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding robust solutions for product design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A collection of test problems for constrained global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piece adding technique for convex maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative algorithms for Gram-Schmidt orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global minimization of concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Global Concave Minimization: A Bibliographic Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5693853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3531003 / rank
 
Normal rank

Latest revision as of 13:52, 11 July 2024

scientific article; zbMATH DE number 6550161
Language Label Description Also known as
English
Inscribed ball and enclosing box methods for the convex maximization problem
scientific article; zbMATH DE number 6550161

    Statements

    Inscribed ball and enclosing box methods for the convex maximization problem (English)
    0 references
    0 references
    0 references
    4 March 2016
    0 references
    local search algorithm
    0 references
    non-convex optimization
    0 references
    convex maximization
    0 references
    inscribed ball
    0 references

    Identifiers