Pith. sign in

REVIEW

Second-Order Strong Optimality and Second-Order Duality for Nonsmooth Constrained Multiobjective Fractional Programming Problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.10093 v1 pith:VCLVS3LB submitted 2024-03-15 math.OC

Second-Order Strong Optimality and Second-Order Duality for Nonsmooth Constrained Multiobjective Fractional Programming Problems

classification math.OC
keywords second-orderconditionsnmfpdirectionalfractionaloptimalitystrongclarke
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

This paper investigates constrained nonsmooth multiobjective fractional programming problem (NMFP) in real Banach spaces. It derives a quotient calculus rule for computing the first- and second-order Clarke derivatives of fractional functions involving locally Lipschitz functions. A novel second-order Abadie-type regularity condition is presented, defined with the help of the Clarke directional derivative and the P\'ales-Zeidan second-order directional derivative. We establish both first- and second-order strong necessary optimality conditions, which contain some new information on multipliers and imply the strong KKT necessary conditions, for a Borwein-type properly efficient solution of NMFP by utilizing generalized directional derivatives. Moreover, it derives second-order sufficient optimality conditions for NMFP under a second-order generalized convexity assumption. Additionally, we derive duality results between NMFP and its second-order dual problem under some appropriate conditions.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.