Pages that link to "Item:Q700700"
From MaRDI portal
The following pages link to Convexifactors, generalized convexity, and optimality conditions (Q700700):
Displaying 37 items.
- Optimality conditions and duality for interval-valued optimization problems using convexifactors (Q276276) (← links)
- Duality for multiobjective fractional programming problem using convexifactors (Q387092) (← links)
- Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386) (← links)
- Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization (Q505143) (← links)
- Optimality and duality results for bilevel programming problem using convexifactors (Q637559) (← links)
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
- Optimality conditions for pessimistic bilevel problems using convexificator (Q830345) (← links)
- Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case (Q850828) (← links)
- Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization (Q987521) (← links)
- Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion (Q2032013) (← links)
- A note on the paper: ``Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem'' (Q2165760) (← links)
- Necessary and sufficient conditions for efficiency via convexificators (Q2251552) (← links)
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming (Q2342953) (← links)
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization (Q2370062) (← links)
- Optimality conditions in optimization problems with convex feasible set using convexificators (Q2408896) (← links)
- Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem (Q2666718) (← links)
- Sufficient optimality conditions and Mond-Weir duality results for a fractional multiobjective optimization problem (Q2691214) (← links)
- Correction to: ``Convexifactors, generalized convexity, and optimality conditions'' (Q2697010) (← links)
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators (Q4639127) (← links)
- Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation (Q4646549) (← links)
- Convexifactors, generalized convexity and vector optimization (Q4656060) (← links)
- Optimality and duality for nonsmooth minimax programming problems using convexifactor (Q5020437) (← links)
- Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem (Q5131829) (← links)
- Optimality conditions for a bilevel optimization problem in terms of KKT multipliers and convexificators (Q5147635) (← links)
- Optimality conditions for a multiobjective bilevel optimization problem involving set valued constraints (Q5162595) (← links)
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints (Q5214315) (← links)
- Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ reformulation (Q5221266) (← links)
- Optimality conditions for maximizing a locally Lipschitz function (Q5317734) (← links)
- Continuous generalized convex functions and their characterizations (Q5317742) (← links)
- Convexificators and necessary conditions for efficiency (Q5413888) (← links)
- Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using ε-upper semi-regular semi-convexificators (Q5865281) (← links)
- Sufficient Optimality Conditions for a Robust Multiobjective Problem (Q6053531) (← links)
- Applying convexificators in robust multiobjective optimization (Q6086987) (← links)
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem (Q6107695) (← links)
- Semistrictly and neatly quasiconvex programming using lower global subdifferentials (Q6164018) (← links)
- Correction to: ``Optimality conditions for pessimistic bilevel problems using convexificator'' (Q6180241) (← links)
- Optimality conditions for MPECs in terms of directional upper convexifactors (Q6186580) (← links)