Pages that link to "Item:Q4656060"
From MaRDI portal
The following pages link to Convexifactors, generalized convexity and vector optimization (Q4656060):
Displaying 46 items.
- Optimality conditions and duality for interval-valued optimization problems using convexifactors (Q276276) (← links)
- Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators (Q346833) (← 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)
- Convexificators and strong Kuhn-Tucker conditions (Q692289) (← links)
- A new Abadie-type constraint qualification for general optimization problems (Q779856) (← links)
- Optimality conditions for multiobjective fractional programming, via convexificators (Q781069) (← links)
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
- Generalized convexity and vector optimization (Q951139) (← links)
- Convexity and marginal vectors (Q1414453) (← links)
- On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians (Q1626525) (← links)
- Vector optimization over cones involving support functions using generalized \((\Phi,\rho)\)-convexity (Q1684343) (← links)
- Sensitivity analysis of the value function for nonsmooth optimization problems (Q1728258) (← links)
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators (Q1730476) (← links)
- Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints (Q1983853) (← links)
- Necessary and sufficient conditions for efficiency via convexificators (Q2251552) (← links)
- Optimality conditions for nonsmooth semidefinite programming via convexificators (Q2355132) (← links)
- Optimality conditions in optimization problems with convex feasible set using convexificators (Q2408896) (← links)
- On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity (Q2656887) (← 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)
- Convexity and optimization in \({\mathbb R^n}\) (Q2782609) (← links)
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators (Q2790868) (← links)
- Nonsmooth multiobjective programming and constraint qualifications (Q2841157) (← links)
- On nonsmooth mathematical programs with equilibrium constraints using generalized convexity (Q3388452) (← links)
- Convexificators and boundedness of the Kuhn–Tucker multipliers set (Q4559391) (← links)
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators (Q4639127) (← links)
- Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators (Q4639187) (← links)
- Optimality conditions of a set valued optimization problem with the help of directional convexificators (Q4986414) (← links)
- Duality for a class of nonsmooth multiobjective programming problems using convexificators (Q5005490) (← links)
- Optimality and duality for nonsmooth minimax programming problems using convexifactor (Q5020437) (← links)
- On variational inequalities using directional convexificators (Q5039394) (← links)
- Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints (Q5214315) (← links)
- On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators (Q5214425) (← 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)
- Convexificators and necessary conditions for efficiency (Q5413888) (← links)
- Applying convexificators in robust multiobjective optimization (Q6086987) (← links)
- Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem (Q6107695) (← links)
- Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds (Q6150648) (← links)
- On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential (Q6204200) (← links)
- On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators (Q6621087) (← links)
- Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators (Q6635232) (← links)
- Sufficient optimality, duality and saddle point analysis in terms of convexificators for nonsmooth robust fractional interval-valued optimization problems (Q6651005) (← links)
