Duality for optimization problems in Banach algebras
From MaRDI portal
Publication:693124
DOI10.1007/s10898-011-9763-5zbMath1281.90086OpenAlexW2053930892MaRDI QIDQ693124
Publication date: 7 December 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9763-5
Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Related Items
Duality problems with second-order polyhedral discrete and differential inclusions, On duality for mathematical programs with vanishing constraints, New optimality conditions for nonsmooth control problems, Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions, Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of nonsmooth quasiconvex and pseudoconvex functions
- The gap function for optimization problems in Banach spaces
- Exact relaxations of non-convex variational problems
- Nondifferentiable multiobjective Mond-Weir type second-order symmetric duality over cones
- An algorithm for the global optimization of a class of continuous minimax problems
- Optimality criteria in mathematical programming involving generalized invexity
- On sufficiency of the Kuhn-Tucker conditions
- Foreword to: Semidefinite programming
- Second order symmetric duality in mathematical programming with \(F\)-convexity
- On invex sets and preinvex functions
- An \(\epsilon\)-sensitivity analysis for semidefinite programming
- Infinite (semi-infinite) problems to characterize the optimality of nonlinear optimization problems
- Nonsmooth Optimization Using Mordukhovich's Subdifferential
- Encyclopedia of Optimization
- A duality theorem for non-linear programming
- On generalised convex mathematical programming
- Convex Analysis
- Semidefinite programming and combinatorial optimization
- Generalized invexity and duality in multiobjective programming problems
- \((p,r)\)-invex sets and functions