46 results on '"Jiménez, Bienvenido"'
Search Results
2. Convex Optimization: Saddle Points Characterization and Introduction to Duality
3. Elements of Convex Analysis. Linear Theorems of the Alternative. Tangent Cones
4. Linear Programming and Quadratic Programming
5. Introduction to Multiobjective Optimization
6. Sensitivity Analysis
7. Constrained Optimization Problems with Inequality Constraints
8. Unconstrained Optimization Problems. Set-Constrained Optimization Problems. Classical Constrained Optimization Problems
9. Constrained Optimization Problems with Mixed Constraints
10. Introduction to Nonsmooth Optimization Problems
11. Basic Notions and Definitions
12. Convex Functions and Generalized Convex Functions
13. Scalarization of Set-Valued Optimization Problems in Normed Spaces
14. Approximation of Weak Efficient Solutions in Vector Optimization
15. Nonlinear Scalarizations of Set Optimization Problems with Set Orderings
16. Approximate Karush–Kuhn–Tucker Condition in Multiobjective Optimization
17. Conditions and parametric representations of approximate minimal elements of a set through scalarization
18. Sufficient Optimality Conditions and Duality in Nonsmooth Multiobjective Optimization Problems under Generalized Convexity
19. Optimality Conditions for Tanaka’s Approximate Solutions in Vector Optimization
20. Benson Proper Efficiency in Set-Valued Optimization on Real Linear Spaces
21. Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
22. An extension of the Basic Constraint Qualification to nonconvex vector optimization problems
23. Higher-order optimality conditions for strict local minima
24. On Approximate Solutions in Vector Optimization Problems Via Scalarization
25. Multiplier Rules and Saddle-Point Theorems for Helbig’s Approximate Solutions in Convex Pareto Problems
26. Optimality conditions in differentiable vector optimization via second-order tangent sets
27. Second order necessary conditions in set constrained differentiable vector optimization
28. Necessary Conditions for Nondominated Solutions in Vector Optimization
29. Sufficient Optimality Conditions and Duality in Nonsmooth Multiobjective Optimization Problems under Generalized Convexity
30. Optimality Conditions for Tanaka’s Approximate Solutions in Vector Optimization
31. A chain rule for ɛ-subdifferentials with applications to approximate solutions in convex Pareto problems
32. Higher-order optimality conditions for strict local minima
33. First and second order sufficient conditions for strict minimality in nonsmooth vector optimization
34. A property of efficient and ε-efficient solutions in vector optimization
35. Benson Proper Efficiency in Set-Valued Optimization on Real Linear Spaces
36. An extension of the Basic Constraint Qualification to nonconvex vector optimization problems
37. Strict Efficiency in Set-Valued Optimization
38. A Note on First-Order Sufficient Optimality Conditions for Pareto Problems
39. A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
40. ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
41. On constraint qualifications in directionally differentiable multiobjective optimization problems
42. Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
43. A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
44. FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING
45. Strict Efficiency in Vector Optimization
46. Second order necessary conditions in set constrained di .erentiable vector optimization.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.