Search results for "convex"

showing 10 items of 389 documents

The norm of the characteristic function of a set in the John‐Nirenberg space of exponent p

2020

Set (abstract data type)Characteristic function (convex analysis)Pure mathematicsGeneral MathematicsGeneral EngineeringExponentSpace (mathematics)Nirenberg and Matthaei experimentBounded mean oscillationMathematicsMathematical Methods in the Applied Sciences
researchProduct

About Combining Metric Learning and Prototype Generation

2014

Distance metric learning has been a major research topic in recent times. Usually, the problem is formulated as finding a Mahalanobis-like metric matrix that satisfies a set of constraints as much as possible. Different ways to introduce these constraints and to effectively formulate and solve the optimization problem have been proposed. In this work, we start with one of these formulations that leads to a convex optimization problem and generalize it in order to increase the efficiency by appropriately selecting the set of constraints. Moreover, the original criterion is expressed in terms of a reduced set of representatives that is learnt together with the metric. This leads to further im…

Set (abstract data type)Matrix (mathematics)Mathematical optimizationOptimization problemmedia_common.quotation_subjectMetric (mathematics)Convex optimizationQuality (business)Equivalence of metricsMathematicsMetric k-centermedia_common
researchProduct

Approximation of Feasible Parameter Set in worst case identification of block-oriented nonlinear models

2003

Abstract The estimation of the Feasible Parameter Set for block-oriented nonlinear models in a worst case setting is considered. A bounding procedure is determined both for polytopic and ellipsoidie sets, consisting in the projection of the FPS ⊂ R MN of the extended parameter vector onto suitable M or N-dimensional subspaces and in the solution of convex optimization problems which provide the extreme points of the Parameter Uncertainties Intervals of the model parameteres. Bounds obtained are tighter then in the previous approaches.

Set (abstract data type)Nonlinear systemMathematical optimizationBounding overwatchConvex optimizationApplied mathematicsExtreme pointLinear subspaceProjection (linear algebra)MathematicsBlock (data storage)
researchProduct

Universal freezing of quantum correlations within the geometric approach

2015

Quantum correlations in a composite system can be measured by resorting to a geometric approach, according to which the distance from the state of the system to a suitable set of classically correlated states is considered. Here we show that all distance functions, which respect natural assumptions of invariance under transposition, convexity, and contractivity under quantum channels, give rise to geometric quantifiers of quantum correlations which exhibit the peculiar freezing phenomenon, i.e., remain constant during the evolution of a paradigmatic class of states of two qubits each independently interacting with a non-dissipative decohering environment. Our results demonstrate from first …

Settore FIS/02 - Fisica Teorica Modelli E Metodi MatematiciFOS: Physical sciencesQuantum entanglementArticleConvexityInformation theory and computation Qubits Quantum information Open quantum systems quantum correlationsStatistical physicsQAQuantumQCCondensed Matter - Statistical MechanicsMathematical PhysicsPhysicsQuantum PhysicsMultidisciplinaryStatistical Mechanics (cond-mat.stat-mech)Probability and statisticsState (functional analysis)Mathematical Physics (math-ph)Quantum technologyPhysics - Data Analysis Statistics and ProbabilityQubitConstant (mathematics)Quantum Physics (quant-ph)Data Analysis Statistics and Probability (physics.data-an)
researchProduct

Order boundedness and spectrum in locally convex quasi *-algebras

2021

After a quick sketch of the basic aspects of locally convex quasi *-algebras, we focus on order bounded elements and use them to analyze some spectral properties, trying to generalize the approach already studied in the Banach case.

Settore MAT/05 - Analisi MatematicaBounded element locally convex quasi *-algebra
researchProduct

Multiple solutions with sign information for a (p,2)-equation with combined nonlinearities

2020

We consider a parametric nonlinear Dirichlet problem driven by the sum of a p-Laplacian and of a Laplacian (a (p,2)-equation) and with a reaction which has the competing effects of two distinct nonlinearities. A parametric term which is (p−1)-superlinear (convex term) and a perturbation which is (p−1)-sublinear (concave term). First we show that for all small values of the parameter the problem has at least five nontrivial smooth solutions, all with sign information. Then by strengthening the regularity of the two nonlinearities we produce two more nodal solutions, for a total of seven nontrivial smooth solutions all with sign informations. Our proofs use critical point theory, critical gro…

Settore MAT/05 - Analisi MatematicaConstant sign and nodal solutionFlow invarianceConvex–concave problemStrong comparison principleCritical groupNonlinear regularity
researchProduct

MR2370688 (2009e:46013) Navarro-Pascual, J. C.; Mena-Jurado, J. F.; Sánchez-Lirola, M. G. A two-dimensional inequality and uniformly continuous retra…

2009

Let X be an infinite-dimensional uniformly convex Banach space and let BX and SX be its closed unit ball and unit sphere, respectively. The main result of the paper is that the identity mapping on BX can be expressed as the mean of n uniformly continuous retractions from BX onto SX for every n >= 3. Then, the authors observe that the result holds under a property weaker than uniform convexity, satisfied by any complex Banach space, so that the result generalizes that of [A. Jim´enez-Vargas et al., Studia Math. 135 (1999), no. 1, 75–81; MR1686372 (2000b:46025)]. As an application the extremal structure of spaces of vector-valued uniformly continuous mappings is studied.

Settore MAT/05 - Analisi MatematicaUniformly convex normed space uniformly continuous retraction extreme point.
researchProduct

Locally Convex Quasi *-Algebras and their Representations

2020

This book is a review of the work the authors have done in the past 20 years on the theory of locally convex quasi *-algebras

Settore MAT/05 - Analisi Matematicalocally convexquasi *-algebraoperator algebrastopological algebra
researchProduct

Energy Efficiency Optimization for Multi-cell Massive MIMO : Centralized and Distributed Power Allocation Algorithms

2021

This paper investigates the energy efficiency (EE) optimization in downlink multi-cell massive multiple-input multiple-output (MIMO). In our research, the statistical channel state information (CSI) is exploited to reduce the signaling overhead. To maximize the minimum EE among the neighbouring cells, we design the transmit covariance matrices for each base station (BS). Specifically, optimization schemes for this max-min EE problem are developed, in the centralized and distributed ways, respectively. To obtain the transmit covariance matrices, we first find out the closed-form optimal transmit eigenmatrices for the BS in each cell, and convert the original transmit covariance matrices desi…

Signal Processing (eess.SP)FOS: Computer and information sciencesmallintaminenComputational complexity theoryComputer scienceenergiatehokkuusComputer Science - Information TheoryMIMO02 engineering and technologyPrecoding0203 mechanical engineeringoptimointistatistical CSIalgoritmit0202 electrical engineering electronic engineering information engineeringFOS: Electrical engineering electronic engineering information engineeringOverhead (computing)Electrical and Electronic EngineeringElectrical Engineering and Systems Science - Signal Processingenergy efficiencymax-min fairnessInformation Theory (cs.IT)020206 networking & telecommunications020302 automobile design & engineeringmulti-cell MIMOCovarianceDistributed algorithmChannel state informationConvex optimizationdistributed processingAlgorithm
researchProduct

From optimization to algorithmic differentiation: a graph detour

2021

This manuscript highlights the work of the author since he was nominated as "Chargé de Recherche" (research scientist) at Centre national de la recherche scientifique (CNRS) in 2015. In particular, the author shows a thematic and chronological evolution of his research interests:- The first part, following his post-doctoral work, is concerned with the development of new algorithms for non-smooth optimization.- The second part is the heart of his research in 2020. It is focused on the analysis of machine learning methods for graph (signal) processing.- Finally, the third and last part, oriented towards the future, is concerned with (automatic or not) differentiation of algorithms for learnin…

Signaux sur graphesOptimisation convexe[STAT.ML]Statistics [stat]/Machine Learning [stat.ML]High dimensional dataGraph signalsStatistiques en grande dimensionAutomatic differentiation[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC][MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC][STAT.ML] Statistics [stat]/Machine Learning [stat.ML]Convex optimizationDifférentiation automatique
researchProduct