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.

168,695 papers · 148 categories

Trend · papers per month

236473709945 · Jun 202019922001200920172026
48 results for nonlinear problems

Study solves inverse problems for equations with fractional nonlinearities.

problem Solving inverse problems for semilinear elliptic equations with fractional power nonlinearities.
method Higher order linearization method adapted for fractional order.
result Results of previous studies remain valid for general power nonlinearities.

Solves geometric problems using fully nonlinear equations and Morse theory.

problem Geometric problems, specifically Loewner-Nirenberg and Yamabe problems.
method Investigates structure of fully nonlinear equations and applies Morse theory techniques.
result Constructs admissible metrics under weak conditions and demonstrates topological obstructions.

Paper presents a new backward deep BSDE method for solving nonlinear FBSDE problems.

problem Nonlinear Forward Backward Stochastic Differential Equations (FBSDE) with terminal conditions.
method Backward deep BSDE method applied to FBSDE with nonlinear generators and random initial conditions.
result Derives exact and Taylor-based approximations for time-stepping nonlinear BSDEs.

Adapts model-based advice to stabilize black-box policies for nonlinear control.

problem Stabilizing machine-learned policies for nonlinear control with limited model information.
method Proposes an adaptive λλ-confident policy to combine black-box and model-based advice.
result Proves the stability of the adaptive λλ-confident policy and its competitive ratio.

Solves curvature problems on manifolds with negative curvature.

problem Prescribed curvature problems on closed manifolds with negative curvature.
method Investigates fully nonlinear prescribed curvature problems for modified Schouten tensor on closed Riemannian manifolds with negative curvature.
result Proves solvability of curvature problems under certain conditions.

Study finds solutions for complex problems on non-compact manifolds.

problem Solving fully nonlinear Yamabe-type problems on non-compact manifolds.
method Existence results for a class of problems, considering both positive and negative cases.
result Explicit examples of manifolds satisfying the hypotheses of the theorems.

We consider a stochastic control problem for a class of nonlinear kernels. More precisely, our problem of interest consists in the optimisation, over a set of possibly non-dominated probability measures, of solutions of backward stochastic differential equations (BSDEs). Since BSDEs are nonlinear generalisations of the…

2015-10-28abs ↗pdf ↗

Geometric programming approach for traffic equilibrium problems.

problem Optimizing traffic equilibrium in transportation systems.
method Finslerian dynamical model for nonlinear complementarity problems.
result Effective solution for various equilibrium problems in transportation.

Study proves radial symmetry of solutions to certain nonlinear equations in space forms.

problem Proving radial symmetry of solutions to nonlinear equations in space forms.
method Establishing Rellich-Pohožaev type identities for Hessian quotient and k-Hessian equations.
result Radial symmetry of solutions for Hessian quotient and k-Hessian equations in space forms.

Proposes a new derivative concept for nonlinear DRO problems.

problem Optimizing nonlinear functions in probability space with distributionally robust optimization.
method Introduces Gateaux derivative for smoothness and proposes a Frank-Wolfe algorithm.
result Validates theoretical results on portfolio selection problems with numerical validation.

We introduce a method for solving Calderón type inverse problems for semilinear equations with power type nonlinearities. The method is based on higher order linearizations, and it allows one to solve inverse problems for certain nonlinear equations in cases where the solution for a corresponding linear equation is not…

2019-03-29abs ↗pdf ↗

New method solves robust matrix completion using nonlinear equations.

problem Recover low rank and sparse matrices from incomplete observations.
method Transforms problem into solving a system of nonlinear equations, then uses the alternative direction method.
result Algorithm converges linearly to the true solution under proper assumptions.

Study on maximum principles for nonlinear equations on Riemannian manifolds.

problem Investigating strong maximum principles for fully nonlinear equations on Riemannian manifolds.
method Analyzing scaling conditions and applying to various nonlinear operators.
result Established new strong comparison principles for second order uniformly elliptic problems.

CAG method predicts nonlinear solid mechanics responses in real-time with high accuracy and efficiency.

problem Real-time prediction of nonlinear solid mechanics responses.
method Clustering adaptive Gaussian process regression (CAG) method.
result Offers predictions within a second with high precision using only 20 samples.

This paper tackles efficient optimization for nonlinear embeddings in similarity learning.

problem Learning similarity with nonlinear embeddings is challenging due to the large number of pairs.
method Detailed derivations and efficient optimization methods for nonlinear embeddings are developed.
result Efficient optimization methods for nonlinear embeddings are shown to be highly effective.

Solves a specific Dirichlet problem on Riemannian manifolds.

problem Dirichlet problem for degenerate fully nonlinear elliptic equations on Riemannian manifolds.
method Derives existence of C1,1C^{1,1}-solutions under appropriate assumptions.
result Existence of C1,1C^{1,1}-solutions.

Signal processing is rich in inherently continuous and often nonlinear applications, such as spectral estimation, optical imaging, and super-resolution microscopy, in which sparsity plays a key role in obtaining state-of-the-art results. Coping with the infinite dimensionality and non-convexity of these problems typica…

2018-11-01abs ↗pdf ↗

New method for separating mixed signals with nonlinear functions.

problem Recovering source signals from nonlinear mixtures.
method Optimisation-based function approximation to minimize mutual statistical dependence.
result The method can recover source signals from nonlinear mixtures under certain conditions.

PGD algorithms solve nonlinear inverse problems with generative priors using noisy measurements.

problem Signal estimation from noisy nonlinear measurements with generative priors.
method Projected gradient descent algorithms for two cases: unknown and known nonlinearity.
result PGD algorithms converge linearly to optimal statistical rates using arbitrary initialization.

Method solves complex optimization problems with high probability bounds.

problem Nonlinear equality constrained stochastic optimization problems.
method Step-search sequential quadratic programming method.
result High-probability bound on iteration complexity for first-order stationarity.

The paper studies fully nonlinear equations on Hermitian manifolds, proving existence and interior estimates.

problem Proving existence and interior estimates for fully nonlinear equations on Hermitian manifolds.
method Derives interior estimates and establishes the existence of smooth solutions for the Dirichlet problem and equations on closed manifolds.
result Derives interior estimates and establishes the existence of smooth solutions for the Dirichlet problem and equations on closed manifolds.

Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformati…

2019-03-21abs ↗pdf ↗

In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization problems. The basic idea is to incorporate a local search step (gradient descent or Quasi-Newton iteration) into these uniformly optimal conv…

2015-08-29abs ↗pdf ↗

Framework for designing nonlinearities in neural networks with slope constraints.

problem Designing nonlinearities with specific properties for signal processing.
method Variational framework with regularization for slope constraints and optimization of adaptive splines.
result Adaptive nonuniform linear splines achieve global optimum in constrained optimization.

New method identifies latent components in nonlinear mixtures without stringent assumptions.

problem Unraveling latent components in nonlinearly mixed data.
method Constrained autoencoder-based algorithm for identifiability under relaxed assumptions.
result Comprehensive sample complexity results and new identifiability conditions.