Fractional programming without differentiability

DOI10.1007/BF01580396zbMath0357.90054WikidataQ56936050 ScholiaQ56936050MaRDI QIDQ4133419

Jonathan M. Borwein

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Constrained vector valued ratio games and generalized subdifferentiable multiobjective fractional minmax programming, Second-order optimality conditions in locally Lipschitz multiobjective fractional programming problem with inequality constraints, About differentiability of order one of quasiconvex functions on \(R^ n\)., Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs, Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems, Unnamed Item, Generalized convexity in nondifferentiable programming, Duality for minmax programming involving nonsmooth v-invex functions, Optimality conditions for vector mathematical programming via a theorem of the alternative, Optimality, duality and saddle point analysis for interval-valued nondifferentiable multiobjective fractional programming problems, Optimality conditions and duality in subdifferentiable multiobjective fractional programming, First- and second-order optimality conditions for multiobjective fractional programming, Bibliography in fractional programming, A generalized Farkas lemma with applications to quasidifferentiable programming

Cites Work

• Nonlinear maximal monotone operators in Banach space
• On the monotonicity of the gradient of a convex function
• A duality theorem for non-linear programming
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Seven Kinds of Convexity
• Convex Analysis
• Duality for nonlinear fractional programs
• Duality in nonlinear fractional programming
• Sufficient conditions for extremum, penalty functions and regularity