Sequential optimality conditions for fractional optimization with applications to vector optimization
From MaRDI portal
Publication:2260685
DOI10.1007/s10957-014-0578-7zbMath1307.90166OpenAlexW1966854304MaRDI QIDQ2260685
Yi Chai, Xian-Jun Long, Xiang-Kai Sun
Publication date: 11 March 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0578-7
vector optimizationsubdifferentialconstraint qualificationsequential optimality conditionsfractional optimization
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items
Some characterizations of robust optimal solutions for uncertain fractional optimization and applications ⋮ Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential ⋮ Some characterizations of duality for DC optimization with composite functions ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem ⋮ Jacobi and Legendre variational tests for a class of generalized fractional variational problem ⋮ Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- On robust duality for fractional programming with uncertainty data
- Liberating the subgradient optimality conditions from constraint qualifications
- Higher-order optimality conditions for set-valued optimization
- Sequential characterization of solutions in convex composite programming and applications to vector optimization
- Conjugate duality in convex optimization
- Symmetric duality for a class of nonlinear fractional programming problems
- Farkas-type results for fractional programming problems
- On strong and total Lagrange duality for convex optimization problems
- Sequential optimality conditions for composed convex optimization problems
- Vector optimization. Set-valued and variational analysis.
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
- On the Subdifferentiability of Convex Functions
- On Nonlinear Fractional Programming
This page was built for publication: Sequential optimality conditions for fractional optimization with applications to vector optimization
