Description
Based on a new concept of generalized relative convexity, a large extension of Hardy-Littlewood-Pólya theorem of majorization is obtained. Several applications escaping the classical framework of convexity are included.
Hardy-Littlewood-Pólya theorem of majorization in the framework of generalized convexity
Additional information
| Author(s) | Niculescu, Constantin P., Rovenţa, Ionel |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2017.01.09 |
Related products
Recently posted
-
Approximate Solutions for Multi-Objective Optimization Problems via Scalarizing and Nonscalarizing Methods
-
A product of strongly quasi-nonexpansive mappings in Hadamard spaces
-
Inertial viscosity fixed point algorithms for monotone inclusion, convex minimization, and image restoration problems
-
Holderian Stability for Parametric Optimization Models and Applications
-
A Novel Fixed-Point Based Two-Step Inertial Algorithm for Convex Bilevel Optimization in Deep Learning Data Classification
-
Double-step inertial algorithms for equilibrium and fixed point problems in Hilbert spaces
-
Accelerated forward-backward algorithm based on inertial and correction terms with linesearch for solving convex minimization problem and its application
-
A Dual-Projective Double Inertial Forward-Backward Splitting Algorithm for Variational Inclusion Problems with Applications to External Validation in Breast Cancer Diagnosis
-
Efficient Large-Scale Classification with Linex Least Square Twin Bounded Support Vector Machine
-
Classifying compressive strength of clay bricks using an inertial projected forward-backward algorithm