DC programming: overview. (Q1969457)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	DC programming: overview.	scientific article

Statements

scholarly article

0 references

DC programming: overview. (English)

0 references

0 references

Nguyen Van Thoai

0 references

Journal of Optimization Theory and Applications

0 references

publication date

2004

0 references

zbMATH Keywords

DC programming, global optimization, optimality conditions,cutting

0 references

plane algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Introduction to global optimization

0 references

On functions representable as a difference of convex functions

0 references

0 references

Mathematical Programs with Equilibrium Constraints

0 references

A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints

0 references

The design centering problem as a d.c. programming problem

0 references

Computing a global optimal solution to a design centering problem

0 references

Approximation of solutions for location problems

0 references

The Packing of Equal Circles in a Square

0 references

0 references

New results in the packing of equal circles in a square

0 references

Algorithms for the vector maximization problem

0 references

Optimization over the efficient set

0 references

0 references

Numerical solution for optimization over the efficient set by d.c. optimization algorithms

0 references

Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem

0 references

Maximizing a concave function over the efficient or weakly-efficient set

0 references

Convex Analysis

0 references

On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization

0 references

0 references

0 references

0 references

Necessary and sufficient global optimality conditions for convex maximization revisited

0 references

A Fenchel-Rockafellar type duality theorem for maximization

0 references

Minimization of continuous convex functional on complements of convex subsets of locally convex spaces<sup>1</sup>

0 references

A general theory of dual optimization problems

0 references

Some further duality theorems for optimization problems with reverse convex constraint sets

0 references

Duality in nonconvex optimization

0 references

The conjugate of the difference of convex functions

0 references

Concave duality: Application to problems dealing with difference of functions

0 references

Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization

0 references

Optimization Problems Subject to a Budget Constraint with Economies of Scale

0 references

Reverse convex programming

0 references

Linear programs with an additional reverse convex constraint

0 references

0 references

Convex programs with an additional reverse convex constraint

0 references

On solving general reverse convex programming problems by a sequence of linear programs and line searches

0 references

On solving a d.c. programming problem by a sequence of linear programs

0 references

Constraint decomposition algorithms in global optimization

0 references

A finite cutting plane method for solving linear programs with an additional reverse convex constraint

0 references

Convergent Algorithms for Minimizing a Concave Function

0 references

0 references

Concave minimization via conical partitions and polyhedral outer approximation

0 references

0 references

0 references

Outer approximation by polyhedral convex sets

0 references

On finding new vertices and redundant constraints in cutting plane algorithms for global optimization

0 references

On-line and off-line vertex enumeration by adjacency lists

0 references

A Successive Underestimation Method for Concave Minimization Problems

0 references

full work available at URL

https://doi.org/10.1023/a:1021765131316

0 references

Identifiers

zbMATH Open document ID

0 references

10.1023/A:1021765131316

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1969457

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1969457&oldid=36901194"