Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,341 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for quadratic solutions

Entire self-shrinking solutions on complex plane are rigid and come from quadratic potentials.

problem Rigidity of entire self-shrinking solutions to Kähler-Ricci flow.
method Showed that all entire self-shrinking solutions must be generated by quadratic potentials.
result Entire self-shrinking solutions on complex plane are rigid and come from quadratic potentials.

Solutions to a quadratic matrix equation are linked to strongly regular graphs and multiplicative characters.

problem Solving a specific quadratic matrix equation in Riemannian geometry.
method Constructing nonzero solutions using group rings and multiplicative characters of finite fields.
result Solutions relate to strongly regular graphs and multiplicative characters of finite fields.

Researchers prove entire self-shrinking solutions to Kähler-Ricci flow are quadratic.

problem Proving rigidity of entire self-shrinking solutions to Kähler-Ricci flow.
method Using a pointwise proof for the rigidity of entire self-shrinking solutions to Lagrangian mean curvature flow, they extend the argument to a broader class of equations.
result Entire self-shrinking solutions to Kähler-Ricci flow are quadratic.

New method solves large-scale QCPs using low-discrepancy sequences.

problem Solving large-scale Quadratically Constrained Quadratic Programs (QCQP).
method Transforming QCQP into a linear problem via low-discrepancy sampling.
result Approximate solutions converge to true solutions and have finite sample error bounds.

Investigates quadratic-exponential growth BSDEs with jumps and proves existence and differentiability.

problem Existence and differentiability of solutions to quadratic-exponential growth BSDEs with jumps.
method Proves existence and differentiability of solutions under general quadratic-exponential structure using local Lipschitz continuity and A_gamma-condition.
result Proves existence and differentiability of solutions under general quadratic-exponential structure.

Solutions near infinity to special Lagrangian equations are asymptotic to quadratic polynomials with logarithmic terms.

problem Solving special Lagrangian equations near infinity with specific conditions.
method Modified Kelvin transforms to characterize remainders in asymptotic expansions.
result Remainders in asymptotic expansions are characterized by a single smooth function in even dimensions and Cn1,αC^{n-1,α} in odd dimensions.

A new algorithm for solving constrained convex optimization problems efficiently.

problem Constrained convex optimization problems requiring high accuracy solutions.
method Second-Order Conditional Gradient Sliding (SOCGS) algorithm, using projection-free methods to solve quadratic subproblems inexactly.
result Converges quadratically in primal gap after a finite number of linearly convergent iterations.

In this article, we prove the existence of bounded solutions of quadratic backward SDEs with jumps, that is to say for which the generator has quadratic growth in the variables (z,u). From a technical point of view, we use a direct fixed point approach as in Tevzadze [38], which allows us to obtain existence and unique…

2012-08-28abs ↗pdf ↗

Study shows uniqueness of solutions on complex manifolds without requiring solution decay.

problem Uniqueness of solutions to Monge-Ampere equation on complex manifolds.
method Caccioppoli inequality techniques applied to Kähler manifolds with sub-quadratic volume growth.
result Uniqueness of bounded C1,1C^{1,1} solutions to Monge-Ampere equation without decay requirement.

V-matrix method fails to consistently estimate conditional probabilities.

problem Inconsistent solutions in V-matrix method for conditional probability estimation.
method Construct constrained quadratic programming problems with inconsistent inequality constraints.
result V-matrix method may not always have a consistent solution for conditional probability estimation.

The paper proves constant rank theorems for special Lagrangian equations.

problem Understanding saddle solutions and Liouville type results for special Lagrangian equations.
method Argument based on saddle solutions and Liouville type results for the special Lagrangian equation.
result Obtained constant rank theorems for saddle solutions to the special Lagrangian equation and the quadratic Hessian equation.

In this note, we derive a Liouville theorem for the complex Monge-Ampère equation. Our result states that if the global solution uu of the complex Monge-Ampère equation with constant right-hand side differs from a quadratic polynomial solution by $o(\abs{x}^2)$ at infinity, then uu is a quadratic polynomial.

2013-03-11abs ↗pdf ↗

New representation of field equations for QMAG, presenting new solutions.

problem Finding new explicit solutions for quadratic metric-affine gravity.
method Developed a new explicit representation of field equations without assumptions on torsion properties.
result Presented two conjectures on new types of solutions of QMAG.

Paper finds unique viscosity solution to complex control problems.

problem Complex stochastic control problems with singular terminal state constraints.
method Establishes existence of unique nonnegative continuous viscosity solution using novel comparison principle.
result Unique viscosity solution to HJB equation for linear-quadratic control problems.

Study of hyperkähler reduction on Riemann surfaces, finding more solutions.

problem Finding solutions to the constant scalar curvature equation on Riemann surfaces.
method Infinite-dimensional hyperkähler reduction associated with the constant scalar curvature equation on a Riemann surface.
result Obtained a more general existence result, leading to a larger hyperkähler moduli space.

New approach finds solutions to games with unbounded controls.

problem Existence of equilibrium in mean-field games with unbounded controls.
method Weak formulation and new existence/stability results for quadratic-growth generalized McKean-Vlasov BSDEs.
result Existence of equilibrium result for non-Markovian mean-field games with unbounded control space.

Over-parametrized networks with quadratic activations can find globally optimal solutions for convex losses.

problem Finding globally optimal solutions in neural networks with quadratic activations.
method Analyzing the landscape properties of loss functions and using Rademacher complexity for generalization.
result Over-parametrization with k2nk \ge \sqrt{2n} enables finding globally optimal solutions for convex losses.

Optimal trading speeds are reduced by small quadratic costs, with specific velocity regimes identified.

problem Optimal trading speeds in the presence of linear and quadratic costs.
method Matched asymptotic expansion techniques to analyze the effects of small quadratic costs.
result Trading speeds inside a band are reduced by the one-third power of quadratic costs, with specific velocity regimes identified.

Eigen-decomposition simplifies quadratic programming with equality constraints.

problem Optimizing solutions under linear equality constraints in quadratic programming.
method Eigenvalue decomposition of the quadratic term matrix to project optimal solutions.
result Established a linear mapping between EQP formulations with and without diagonalized QQ.

We consider spacetime to be a connected real 4-manifold equipped with a Lorentzian metric and an affine connection. The 10 independent components of the (symmetric) metric tensor and the 64 connection coefficients are the unknowns of our theory. We introduce an action which is quadratic in curvature and study the resul…

2003-04-06abs ↗pdf ↗

Optimal contracts are found for agents with quadratic effort costs.

problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.

Study how transaction costs impact stock returns and holdings in equilibrium.

problem Impact of quadratic transaction costs on equilibrium stock returns and holdings.
method Developed a continuous-time risk-sharing model with FBSDEs to characterize equilibrium stock holdings and trading rates.
result Equilibrium stock holdings and trading rates are uniquely determined by FBSDEs, and equilibrium return by a system of coupled FBSDEs.

We consider a financial model where the prices of risky assets are quoted by a representative market maker who takes into account an exogenous demand. We characterize these prices in terms of a system of BSDEs with quadratic growth. We show that this system admits a unique solution for every bounded demand if and only …

2014-08-05abs ↗pdf ↗

Study solves HJB equations for time-inconsistent control problems.

problem Time-inconsistent deterministic linear quadratic control problems.
method Characterized solutions using Riccati equations with integral terms, proving uniqueness.
result Uniqueness of solutions to equilibrium HJB equations proved.

The paper develops an expansion for optimizing portfolios with small quadratic transaction costs.

problem Optimizing portfolios with small, instantaneous, quadratic transaction costs.
method Develops an asymptotic expansion for the Hamilton-Jacobi-Bellman equation.
result Derives explicit formulae for the first two terms of the expansion.

One-pass SGD dynamics in overparameterized quadratic networks show slow escape from poor solutions.

problem Slow escape from poor generalization solutions in overparameterized neural networks.
method Analysis of one-pass SGD dynamics using ordinary differential equations for overlap matrices.
result Overparameterization only modestly accelerates escape from poor solutions.

Solves generalized twisted rabbit problems for higher degree polynomials.

problem When a quadratic polynomial is twisted by a cyclic subgroup, what polynomial is equivalent?
method Uses d2d^2-adic expansion instead of 4-adic for higher degree polynomials.
result Provides a solution that depends on the d2d^2-adic expansion of the power of the mapping class element.

The study classifies harmonic cubic polynomials in up to 4 dimensions.

problem Describing harmonic cubic polynomials with specific Hessian properties.
method Construction and classification in all dimensions; techniques for inequivalence determination.
result Classification of solutions in dimensions up to 4.

This research proves that quadratic regularized optimal transport can approximate the Laplace-Beltrami operator on smooth manifolds.

problem Approximating the Laplace-Beltrami operator using optimal transport with quadratic regularization.
method Deriving first-order optimal potentials and analyzing the convergence of discrete Laplace operators.
result The discrete Laplace operators converge to the Laplace-Beltrami operator on smooth manifolds.

Solves new quadratic BSDE systems for market performance analysis.

problem Characterizing forward performance processes in regime switching markets.
method Introduces and solves ergodic BSDE systems in infinite time horizon.
result Connection between ergodic BSDE solutions and long-term growth rates of utility maximization.

Neural network discovers exact solutions to QP with linear constraints.

problem Discovering exact solutions to Quadratic Programs (QP) with linear constraints using neural networks.
method Proposes a neural network modeling approach that analytically derives model parameters from problem coefficients, ensuring closed-form solutions without training.
result The closed-form NN model produces exact solutions for every critical region of the QP solution function, outperforming DNNs and commercial solvers in terms of optimality and feasibility.

Efficiently solves heterogeneous QPs by reducing variables using instance-specific projections.

problem Solving high-dimensional quadratic programming problems efficiently.
method Data-driven framework with a graph neural network generating projections tailored to each QP instance.
result Produces high-quality solutions with reduced computation time, outperforming existing methods.