Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
From MaRDI portal
Publication:1101679
DOI10.1016/0022-247X(88)90309-5zbMath0642.49018OpenAlexW1980897037MaRDI QIDQ1101679
Publication date: 1988
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(88)90309-5
dualityinvexitysaddle-pointlocally Lipschitzgeneralized Kuhn-Tucker and Fritz John optimality conditions
Convex programming (90C25) Nonlinear programming (90C30) Duality theory (optimization) (49N15) Special properties of functions of several variables, Hölder conditions, etc. (26B35) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items (28)
Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems ⋮ Characterization Theorems Associated with (F, ρ)-Convex and (F, ρ)-Pseudoconvex Functions ⋮ Optimality and duality in multiobjective fractional programming involving \(\rho\)-semilocally type I-preinvex and related functions ⋮ Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems ⋮ A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming. ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions. ⋮ Saddle point criteria in multiobjective fractional programming involving exponential invexity ⋮ Subvexormal functions and subvex functions ⋮ The generalized quasi-variational inequality problem with applications ⋮ Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions ⋮ G-saddle point criteria andG-Wolfe duality in differentiate mathematical programming ⋮ Exponential type vector variational-like inequalities and nonsmooth vector optimization problems ⋮ On saddle points and optima for non-smooth and non-convex programs ⋮ Optimality conditions and duality for a class of nondifferentiable multi-objective fractional programming problems ⋮ Partial vector invexity and fractional minmax problem ⋮ Sufficiency and duality for nonsmooth multiobjective programming problems involving generalized \((F,\alpha ,\rho ,\theta)\)-d-V-univex functions ⋮ Parametric nondifferentiable multiobjective fractional programming under (b;;; )-univexity ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity ⋮ On \((p,r)\)-invexity-type nonlinear programming problems. ⋮ Optimality conditions and duality for multiobjective measurable subset selection problems ⋮ (Φ, ρ)-Invexity in Nonsmooth Optimization ⋮ Optimality and duality for nonsmooth multiobjective programming problems with \(V\)-\(r\)-invexity ⋮ Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints ⋮ Composite nonsmooth multiobjective programs with \(V\)-\(\rho\)-invexity ⋮ Optimality and duality for the multiobjective fractional programming with the generalized \((F,\rho)\) convexity. ⋮ On invexity-type nonlinear programming problems
Cites Work
- The essence of invexity
- Equivalence of saddle-points and optima for non-concave programmes
- On sufficiency of the Kuhn-Tucker conditions
- A subgradient duality theorem
- Symmetric dual nonlinear programs
- Strong and Weak Convexity of Sets and Functions
- Convexlike alternative theorems and mathematical programming
- What is invexity?
- Necessary and sufficient conditions in constrained optimization
- A duality theorem for non-linear programming
- Invex functions and constrained local minima
- Characterizations of optimality without constraint qualification for the abstract convex program
- A New Approach to Lagrange Multipliers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
