Quasiconvex duality theory by generalized conjugation methods
From MaRDI portal
Publication:3824934
DOI10.1080/02331938808843379zbMath0671.49015OpenAlexW2021281641MaRDI QIDQ3824934
Publication date: 1988
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938808843379
Nonlinear programming (90C30) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)
Related Items (64)
A comparison of alternative c-conjugate dual problems in infinite convex optimization ⋮ Duality theorems for separable convex programming without qualifications ⋮ Nonlinear error bounds for quasiconvex inequality systems ⋮ Duality for quasiconvex minimization over closed convex cones ⋮ Abstract concavity of increasing co-radiant and quasi-concave functions with applications in mathematical economics ⋮ Duality between direct and indirect preferences ⋮ Lower subdifferentiability in minimax fractional programming* ⋮ Duality between direct and indirect utility functions under minimal hypotheses ⋮ Global optimization of the difference of two increasing plus-convex-along-rays functions ⋮ Diewert-Crouzeix conjugation for general quasiconvex duality and applications ⋮ Global minimization of the difference of increasing co-radiant and quasi-concave functions ⋮ Set-valued evenly convex functions: characterizations and C-conjugacy ⋮ Multipliers and general Lagrangians ⋮ The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ Weak lower subdifferentials and applications ⋮ Generalized convex relations with applications to optimization and models of economic dynamics ⋮ Vector topical function, abstract convexity and image space analysis ⋮ Characterization of \(\mathbf R\)-evenly quasiconvex functions ⋮ Radiant separation theorems and minimum-type subdifferentials of calm functions ⋮ Subdifferentials with respect to dualities ⋮ Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Characterizations of the solution set for non-essentially quasiconvex programming ⋮ Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions ⋮ Characterizations of solution sets of differentiable quasiconvex programming problems ⋮ Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization ⋮ Conjugate quasiconvex nonnegative functions ⋮ On duality concepts in fractional programming ⋮ ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY ⋮ Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation ⋮ Fractional programming by lower subdifferentiability techniques ⋮ Evenly convex sets, and evenly quasiconvex functions, revisited ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ On ℋn+1-convex functions: asymptotic behaviour and subdifferentials ⋮ Minimizing the Difference of Dual Functions of Two Coradiant Functions ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Some remarks on the class of continuous (semi-)strictly quasiconvex functions ⋮ Duality theorems for quasiconvex programming with a reverse quasiconvex constraint ⋮ Lower subdifferentiability of quadratic functions ⋮ An abstract symmetric framework for duality in mathematical programming ⋮ Critical duality ⋮ Approximative quasi-subdifferentials ⋮ Unnamed Item ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ Global minimization of the difference of strictly non-positive valued affine ICR functions ⋮ Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ V -dualities and ⊥-dualities ⋮ Subdifferential calculus for a quasiconvex function with generator ⋮ Are dualities appropriate for duality theories in optimization? ⋮ Optimality conditions and constraint qualifications for quasiconvex programming ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ Abstract convexity:examples and applications ⋮ What is quasiconvex analysis? ⋮ Representation of generalized monotone multimaps ⋮ Global optimization of the difference of affine increasing and positively homogeneous functions ⋮ Unnamed Item ⋮ Abstract convexity of extended real-valued ICR functions ⋮ Duality for the level sum of quasiconvex functions and applications ⋮ Analyzing linear systems containing strict inequalities via evenly convex hulls ⋮ Characterizations of evenly convex sets and evenly quasiconvex functions ⋮ On linear systems containing strict inequalities ⋮ Projective dualities for quasiconvex problems ⋮ Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Lagrange duality for evenly convex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower subdifferentiable functions and their minimization by cutting planes
- Lexicographical order, lexicographical index, and linear operators
- Conjugaison par tranches
- Surrogate dual problems and surrogate Lagrangians
- A general theory of dual optimization problems
- Some relations between dualities, polarities, coupling functionals, and conjugations
- A general theory of surrogate dual and perturbational extended surrogate dual optimization problems
- Infimal generators and dualities between complete lattices
- About differentiability of order one of quasiconvex functions on \(R^ n\).
- Lexicographical separation in \({\mathbb{R}}^ n\)
- Maximal convex sets
- œ-conjugation and nonconvex optimization. a survey (part i)
- Duality in generalized linear fractional programming
- The structure of semispaces
- The lower semi-continuous quasi-convex hull as a normalized second conjugate
- Optimization by level set methods v:duality theorems for perturbed optimization problems2
- Conjugate functionals and level sets
- Conjugacy in quasi-convex programming
- Exact quasiconvex conjugation
- Level sets and the minimal time function of linear control processes
- Φ-Conjugation and noneonvex optimization. a survey (part III)
- A convex-like duality scheme for quasi-convex programs
- Surrogate duality for vector optimization
- Global saddle-point duality for quasi-concave programs
- Calculating surrogate constraints
- An elementary survey of general duality theory in mathematical programming
- Global saddle-point duality for quasi-concave programs, II
- On abstract duality in mathematical programming
- Optimization by level set methods. IV: Generalizations and complements
- Una caracterización dual de optimalidad para optimización convexa
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- On $\Phi $-Convexity in Extremal Problems
- Comments on the general duality survey by J. Tind and L.A. Wolsey
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- Convex Analysis
- Quasi-Convex Programming
- Surrogate Mathematical Programming
- Some Properties of Generalized Concave Functions
This page was built for publication: Quasiconvex duality theory by generalized conjugation methods
