Pages that link to "Item:Q1301893"

The following pages link to Nonsmooth calculus, minimality, and monotonicity of convexificators (Q1301893):

Displaying 50 items.

• Optimality conditions and duality for interval-valued optimization problems using convexifactors (Q276276) (← links)
• Optimality condition for local efficient solutions of vector equilibrium problems via convexificators and applications (Q346826) (← links)
• Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators (Q346833) (← links)
• Duality for multiobjective fractional programming problem using convexifactors (Q387092) (← links)
• On constraint qualifications in terms of approximate Jacobians for nonsmooth continuous optimization problems (Q412731) (← 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)
• Convexifactors, generalized convexity, and optimality conditions (Q700700) (← links)
• Subdifferential calculus for a quasiconvex function with generator (Q719604) (← 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)
• Optimality conditions for pessimistic bilevel problems using convexificator (Q830345) (← links)
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case (Q850828) (← links)
• Necessary optimality conditions for bilevel set optimization problems (Q925230) (← links)
• Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization (Q987521) (← links)
• The subdifferentiability properties of typical functions in \(C[0,1]\) (Q1381611) (← links)
• Regularity properties of constrained set-valued mappings (Q1406781) (← links)
• Local uniqueness of solutions of general variational inequalities (Q1411494) (← links)
• The Fréchet approximate Jacobian and local uniqueness in variational inequalities (Q1604271) (← links)
• An open mapping theorem using unbounded generalized Jacobians (Q1612598) (← links)
• On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians (Q1626525) (← links)
• Sensitivity analysis of the value function for nonsmooth optimization problems (Q1728258) (← links)
• Optimality and duality in constrained interval-valued optimization (Q1728410) (← 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)
• Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion (Q2032013) (← links)
• On global subdifferentials with applications in nonsmooth optimization (Q2052399) (← links)
• Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization (Q2077957) (← links)
• A study on vector variational-like inequalities using convexificators and application to its bi-level form (Q2171112) (← links)
• Metric regularity of quasidifferentiable mappings and optimality conditions for nonsmooth mathematical programming problems (Q2194602) (← links)
• On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
• Necessary and sufficient conditions for efficiency via convexificators (Q2251552) (← links)
• Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications (Q2311117) (← links)
• Necessary efficiency conditions for vector equilibrium problems with general inequality constraints via convexificators (Q2326943) (← links)
• Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming (Q2342953) (← links)
• Optimality conditions for nonsmooth semidefinite programming via convexificators (Q2355132) (← 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)
• Normal coderivative for multifunctions and implicit function theorems (Q2473859) (← links)
• Necessary optimality conditions for bilevel optimization problems using convexificators (Q2494307) (← 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)
• Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators (Q2790868) (← links)
• Nonsmooth multiobjective programming and constraint qualifications (Q2841157) (← links)
• Generalized convex functions and generalized differentials (Q2868908) (← links)
• Fuzzy and Exact Optimality Conditions for a Bilevel Set-Valued Problem via Extremal Principles (Q3058362) (← links)