A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Qing-Hua Zhang / rank
Normal rank
 
Property / author
 
Property / author: Qing-Hua Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-012-9908-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061195653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A level set algorithm for a class of reverse convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on a reverse convex programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Algebra Lift Operators for 0-1 Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate optimality conditions and stopping criteria in canonical DC programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer approximation algorithms for canonical DC problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem / 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: A finite cutting plane method for solving linear programs with an additional reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5690240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for solving reverse convex programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex envelope formula for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fenchel-Rockafellar type duality theorem for maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some further duality theorems for optimization problems with reverse convex constraint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the \({\mathfrak R}\)-strategy for a reverse convex problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4733680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programs with several additional reverse convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified version of Tuy's method for solving d.c. programing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A duality principle for non-convex optimisation and the calculus of variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the editor: Remarks on an algorithm for reverse convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programs with an additional reverse convex constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of a difference of two convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical DC programming problem: Outer approximation methods revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global optimality conditions and cutting plane algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer approximation algorithms for DC programs and beyond / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:54, 6 July 2024

scientific article
Language Label Description Also known as
English
A new necessary and sufficient global optimality condition for canonical DC problems
scientific article

    Statements

    A new necessary and sufficient global optimality condition for canonical DC problems (English)
    0 references
    8 April 2013
    0 references
    0 references
    global optimization
    0 references
    DC programming
    0 references
    global optimality condition
    0 references
    cutting plane algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references