Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
From MaRDI portal
Publication:811400
DOI10.1016/0022-247X(91)90197-8zbMath0734.90073MaRDI QIDQ811400
Publication date: 1991
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Methods involving semicontinuity and convergence; relaxation (49J45) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Abstract concavity of increasing co-radiant and quasi-concave functions with applications in mathematical economics ⋮ Dual representations of hulls for functions satisfyingf(0) = inff(X\{0})* ⋮ D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems ⋮ Diewert-Crouzeix conjugation for general quasiconvex duality and applications ⋮ Multipliers and general Lagrangians ⋮ Dual approach to minimization on the set of Pareto-optimal solutions ⋮ Dual problems of quasiconvex maximisation ⋮ Conjugate duality for vector-maximization problems ⋮ Conjugate quasiconvex nonnegative functions ⋮ Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation ⋮ Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization ⋮ Minimizing the Difference of Dual Functions of Two Coradiant Functions ⋮ Mathematical programs with a two-dimensional reverse convex constraint ⋮ The complementary convex structure in global optimization ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Generalized envelope theorems: applications to dynamic programming ⋮ A generalized duality and applications ⋮ Critical duality ⋮ An inner approximation method incorporating with a penalty function method for a reverse convex programming problem ⋮ Set containment characterization with strict and weak quasiconvex inequalities ⋮ Are dualities appropriate for duality theories in optimization? ⋮ What is quasiconvex analysis? ⋮ Set containment characterization for quasiconvex programming ⋮ Projective dualities for quasiconvex problems ⋮ Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications ⋮ A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to sensitivity and stability analysis in nonlinear programming
- On the global minimization of concave functions
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- The conjugate of the difference of convex functions
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Convex programs with an additional reverse convex constraint
- A general theory of dual optimization problems
- Some relations between dualities, polarities, coupling functionals, and conjugations
- Convex programs with several additional reverse convex constraints
- Linear programs with an additional reverse convex constraint
- Reverse convex programming
- Duality in nonconvex optimization
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
- The lower semi-continuous quasi-convex hull as a normalized second conjugate
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
- Concave minimization under linear constraints with special structure
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Global optimization under Lipschitzian constraints
- A method for globally minimizing concave functions over convex sets
- Minimization of continuous convex functional on complements of convex subsets of locally convex spaces1
- Convergent Algorithms for Minimizing a Concave Function
- A Successive Underestimation Method for Concave Minimization Problems
- Approximate method of solving concave programming problems
- Concave minimization over a convex polyhedron
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
