Skip to search formSkip to main contentSkip to account menu

Convex conjugate

Known as: Fenchel's inquality, Legendre–Fenchel transformation, Convex conjugation 
In mathematics and mathematical optimization, the convex conjugate of a function is a generalization of the Legendre transformation. It is also known… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
Bipolar theoremBregman divergenceClosed convex functionConvex function

Broader (1)

Convex analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Subjective Expectations and Asset-Return Puzzles
In textbook expositions of the equity-premium, riskfree-rate and equity-volatility puzzles, agents are sure of the economy's… 
Highly Cited
2004
Highly Cited
2004
Particle filters for mixture models with an unknown number of components
We consider the analysis of data under mixture models where the number of components in the mixture is unknown. We concentrate on… 
Highly Cited
2003
Highly Cited
2003
A Practical Attack on Some Braid Group Based Cryptographic Primitives
A simple heuristic approach to the conjugacy problem in braid groups is described. Although it does not provide a general… 
Highly Cited
2003
Highly Cited
2003
Strong cooperative enhancement of two-photon absorption in dendrimers
We present, for the first time, unambiguous spectroscopic evidence of strong cooperative enhancement of two-photon absorption… 
Review
1998
Review
1998
From Potential Theory to Matrix Iterations in Six Steps
The theory of the convergence of Krylov subspace iterations for linear systems of equations (conjugate gradients, biconjugate… 
Highly Cited
1996
Highly Cited
1996
Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
Several iterative methods for solving linear systems $Ax=b$ first construct a basis for a Krylov subspace and then use the basis… 
Highly Cited
1995
Highly Cited
1995
A discrete BCG-FFT algorithm for solving 3D inhomogeneous scatterer problems
In this paper, an algorithm for computation of the scattered fields from three dimensional inhomogeneous dielectric scatterers is… 
Highly Cited
1992
Highly Cited
1992
How Fast are Nonsymmetric Matrix Iterations?
Three leading iterative methods for the solution of nonsymmetric systems of linear equations are CGN (the conjugate gradient… 
Highly Cited
1992
Highly Cited
1992
Conjugate Gradient-Type Methods for Linear Systems with Complex Symmetric Coefficient Matrices
Conjugate gradient-type methods for the solution of large sparse linear systems $Ax = b$ with complex symmetric coefficient… 
Highly Cited
1992
Highly Cited
1992
TNPACK—A truncated Newton minimization package for large-scale problems: I. Algorithm and usage
We present a FORTRAN package of subprograms for minimizing multivariate functions without constraints by a truncated Newton… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)