Abstract convexity and global optimization
From MaRDI portal
Set-valued and variational analysis (49J53) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Some generalizations of the convex subdifferential are based on abstract convexity, that is, on the representation of a function of a rather complicated nature as the upper envelope of a set of fairly simple functions. The subject matter of this book is concerned with abstract convexity and its relation to global optimization. In Chapter 1 some definitions related to abstract convexity are introduced. In Chapter 2-6 the main objects of this theory are described for some concrete sets of elementary functions. In Chapter 7 abstract convexity are examined in a general situation. In Chapters 8 and 9 both theoretical and numerical aspects of global optimization based on abstract convexity are studied. Some numerical methods, in particular versions of the cutting angle method, branch-and-bound methods and a method for monotonic optimization are described and results of numerical experiments are given. The book is of interest to specialists in global optimization, mathematical programming, convex analysis, as well as engineers using mathematical tools and optimization techniques.
Recommendations
Cited in
(only showing first 100 items - show all)- Optimality conditions in global optimization and their applications
- A \(\mathbb B\)-convex production model for evaluating performance of firms
- Abstract convexity and Hermite-Hadamard type inequalities
- Monotonic analysis over ordered topological vector spaces. IV
- On global optimality conditions and cutting plane algorithms
- Lagrangian approach to quasiconvex programing
- Least squares splines with free knots: Global optimization approach.
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Efficient and weakly efficient solutions for the vector topical optimization
- Global minimization of the difference of increasing co-radiant and quasi-concave functions
- Factor-specific technology choice
- Vector topical function, abstract convexity and image space analysis
- Global optimality conditions for fixed charge quadratic programs
- Radiant separation theorems and minimum-type subdifferentials of calm functions
- A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem
- D.C. programming approach for solving an applied ore-processing problem
- Minimax theorems for extended real-valued abstract convex-concave functions
- Minty variational inequalities, increase-along-rays property and optimization
- Increasing convex-along-rays functions with applications to global optimization
- Abstract convexity of radiant functions with applications
- Vector topical functions and Farkas type theorems with applications
- Global minimization of the difference of strictly non-positive valued affine ICR functions
- A survey on the non-occurence of the Lavrentiev gap for convex, autonomous multiple integral scalar variational problems
- Ky-Fan inequality, Nash equilibria in some idempotent and harmonic convex structure
- Duality between multi-output production correspondences and cost functions
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces
- Duality for quasiconvex minimization over closed convex cones
- Robust strong duality for nonconvex optimization problem under data uncertainty in constraint
- Global optimization of the difference of two increasing plus-convex-along-rays functions
- On weak conjugacy, augmented Lagrangians and duality in nonconvex optimization
- Starshaped sets
- Minimum type functions, plus-cogauges, and applications
- A new augmented Lagrangian approach to duality and exact penalization
- Maximal abstract monotonicity and generalized Fenchel's conjugation formulas
- New global optimality conditions for nonsmooth DC optimization problems
- On non-expansivity of topical functions by a new pseudo-metric
- Some new properties of inconsistent pairwise comparisons matrices
- Projective dualities for quasiconvex problems
- Benchmark-based evaluation of portfolio performance: a characterization
- Conjugate duality for constrained optimization via image space analysis and abstract convexity
- Properties of the nonlinear scalar functional and its applications to vector optimization problems
- Globally optimal solutions of max-min systems
- Sufficient global optimality conditions for weakly convex minimization problems
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Explicitly quasiconvex set-valued optimization
- Increasing-along-rays property, vector optimization and well-posedness
- Abstract convexity, global optimization and data classification.
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Hermite-Hadamard-type inequalities for increasing positively homogeneous functions
- Nash points, Ky Fan inequality and equilibria of abstract economies in Max-plus and \(\mathbb B\)-convexity
- Critical duality
- Reducing exhausters
- Vector optimization problems with nonconvex preferences
- A geometric framework for nonconvex optimization duality using augmented Lagrangian functions
- Softness, sleekness and regularity properties in nonsmooth analysis
- Classes and clusters in data analysis
- Interpolation of Lipschitz functions
- First-order optimality conditions in set-valued optimization
- About regularity of collections of sets
- On the Lavrentiev phenomenon for multiple integral scalar variational problems
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- Capra-convexity, convex factorization and variational formulations for the _0 pseudonorm
- Duality for minimization of the difference of two \(\Phi_c\)-convex functions
- Convexity and montonicity in global optimization.
- Abstract concavity of increasing co-radiant and quasi-concave functions with applications in mathematical economics
- Q-subdifferential and Q-conjugate for global optimality
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- On the global minimization of increasing positively homogeneous functions over the unit simplex
- I_m-quasi upward sets, with their best approximations
- Convexity with respect to min-type functions
- Cutting angle method – a tool for constrained global optimization
- Multidirectional Mean Value Inequalities in Quasidifferential Calculus
- Monotonic Analysis Over Nonconvex Cones
- Characterization of solutions of strong-weak convex programming problems
- Some nonlinear Lagrange and penalty functions for problems with a single constraint
- Best approximation by downward sets with applications
- Convexity and Zariski decomposition structure
- Nonsmooth optimization
- A Study of Downward Sets withp-Functions
- Generalized positive sets and abstract monotonicity
- Optimization of the difference of topical functions
- Saddle points and scalarizing sets in multiple objective linear programming
- How to build aggregation operators from data
- Comparative analysis of the cutting angle and simulated annealing methods in global optimization
- Geometry and combinatorics of the cutting angle method
- Increasing radiant functions
- Abstract convex sets with respect to the class of general min-type functions
- Almost all normal sets are strictly normal
- Topologies on lattice ordered groups, separation from closed downward sets and conjugations of type Lau
- Topical and sub-topical functions, downward sets and abstract convexity
- Some criteria for maximal abstract monotonicity
- Some results on abstract convexity of functions
- Farkas-type theorems and applications: from IPH functions to ICR functions
- Characterizing sub-topical functions
- scientific article; zbMATH DE number 7033669 (Why is no real title available?)
- On ℋn+1-convex functions: asymptotic behaviour and subdifferentials
- The sharpening Hölder inequality via abstract convexity
- Minimizing the Difference of Dual Functions of Two Coradiant Functions
This page was built for publication: Abstract convexity and global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941849)
