Abstract: Survey on quadratic Hessian equations, their properties, and open problems.
problem Understanding quadratic Hessian equations and their solutions.
method Survey and review of existing research.
result Survey of entire solutions, viscosity solutions, and Hessian estimates.
Unique minimal surfaces near quadratic cones are identified.
problem Identifying minimal surfaces near quadratic cones.
method Analyzing minimal hypersurfaces inside the unit ball with perturbed boundary conditions.
result Minimal surfaces are uniquely determined by their boundary conditions.
We consider the problem of solving a large-scale Quadratically Constrained Quadratic Program. Such problems occur naturally in many scientific and web applications. Although there are efficient methods which tackle this problem, they are mostly not scalable. In this paper, we develop a method that transforms the quadra…
In the paper, we consider three quadratic optimization problems which are frequently applied in portfolio theory, i.e, the Markowitz mean-variance problem as well as the problems based on the mean-variance utility function and the quadratic utility.Conditions are derived under which the solutions of these three optimiz…
IntHT solves sparse quadratic regression in sub-quadratic time and space.
problem Sparse quadratic regression in high-dimensional problems.
method Interaction Hard Thresholding (IntHT) is a variant of Iterative Hard Thresholding tailored for quadratic structures.
result IntHT provably converges to a consistent estimate under high-dimensional sparse recovery assumptions.
We consider a proximal operator given by a quadratic function subject to bound constraints and give an optimization algorithm using the alternating direction method of multipliers (ADMM). The algorithm is particularly efficient to solve a collection of proximal operators that share the same quadratic form, or if the qu…
Paper addresses quadratic feasibility problems and their sample complexity.
problem Recovering complex vectors from quadratic measurements.
method Analyzes conditions for identifiability and explores optimization landscape.
result Gradient algorithms can converge to globally optimal solutions with high probability.
The paper classifies biharmonic quadratic maps between spheres, proving their energy density properties.
problem Classifying non-harmonic biharmonic quadratic forms between spheres.
method Proving non-harmonic biharmonic quadratic forms have constant energy density and classifying them.
result Non-harmonic biharmonic quadratic forms have constant energy density (m+1)/2. Paper proposes a QUBO formulation that reduces binary variables in Bayesian network learning.
problem Reducing the number of binary variables in QUBO formulations for Bayesian network learning.
method Proposes a new QUBO formulation that minimizes binary variables.
result Significantly reduces the number of binary variables required for Bayesian network structure learning.
Python package for projecting onto quadratic hypersurfaces.
problem Projections onto non-cylindrical central quadratic hypersurfaces.
method User-friendly Python package with documentation.
result Efficiently projects points onto quadratic hypersurfaces.
The paper solves a utility-based hedging problem with quadratic costs.
problem Optimal trading strategy for hedging European contingent claims with quadratic transaction costs.
method Duality theory applied to exponential utility maximization problem.
result Explicit computation of optimal trading strategy for quadratic payoffs.
We describe all pseudo-Riemannian metrics on closed surfaces whose geodesic flows admit nontrivial integrals quadratic in momenta. As an application, we solve the Beltrami problem on closed surfaces and prove the nonexistence of quadratically-superintegrable metrics of nonconstant curvature on closed surfaces
This paper concerns a method of selecting a subset of features for a sequential logit model. Tanaka and Nakagawa (2014) proposed a mixed integer quadratic optimization formulation for solving the problem based on a quadratic approximation of the logistic loss function. However, since there is a significant gap between …
The paper studies optimal transport in linear quadratic systems and derives interpolation inequalities.
problem Optimal transport problem in Linear Quadratic optimal control systems.
method Well-posedness of the Monge problem, regularity of optimal transport map, displacement interpolation of measures.
result Derivation of general interpolation inequalities for entropy functionals.
Market maker optimizes SPX and VIX spread using quadratic rough Heston model.
problem Maximizing profit from SPX and VIX spread while managing inventory risk.
method Uses quadratic rough Heston model to optimize multi-asset market making problem, approximating high-dimensional optimization.
result Asymptotic closed-form solution for optimization problem.
This study analyzes the quadratic Wasserstein metric's effects on inverse data matching.
problem Analyzing the quadratic Wasserstein metric's impact on inverse data matching.
method Characterizes and numerically analyzes the smoothing effect and convexity improvement of W2 distance. result The W2 distance improves convexity and reduces resolution for reconstructed objects at a given noise level. Paper develops methods for non-quadratic loss low-rank matrix recovery.
problem Recovery of low-rank matrices with non-quadratic losses.
method Projected gradient method with a regularity projection oracle.
result Projected gradient method converges globally and linearly.
Deep learning solves high-dimensional quadratic hedging problems.
problem High-dimensional incomplete markets with mean-variance and local risk minimization.
method Deep learning-based BSDE solver for optimal hedging strategies.
result High-dimensional quadratic hedging is efficiently computed with deep learning.
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.
Paper presents an ADMM-based approach to efficiently integrate quadratic programming layers into neural networks.
problem Integrating quadratic programs into neural networks for optimization.
method An ADMM-based network layer architecture for solving quadratic programs efficiently.
result The ADMM layer is approximately an order of magnitude faster than existing methods for medium scaled problems.
Paper classifies conic submanifolds in control systems.
problem Characterizing and classifying conic submanifolds in control systems.
method Feedback equivalence of control-affine and fully nonlinear systems.
result Complete description of non-degenerate conic submanifolds.
Investment strategy optimization from discrete to continuous models.
problem Optimizing investment strategies and stopping times in both continuous and discrete settings.
method Characterized value functions via quadratic reflected BSDEs for continuous case, discretized BSDEs for discrete case, and derived uniform convergence rates.
result Uniform convergence and rate from discrete to continuous quadratic reflected BSDEs.
We introduce O-systems (Definition \ref{DO}) of orthogonal transformations of Rm, and establish 1−1 correspondences both between equivalence classes of Clifford systems and that of O-systems, and between O-systems and orthogonal multiplications of the form $μ:{\Bbb R}^{n} \times {\Bbb R}^{m} \longrightarr…
RL solves discrete LQ control with Gaussian optimal policy.
problem Discrete-time linear-quadratic control problem.
method Entropy-based RL to find Gaussian optimal policy.
result RL algorithm solves mean-variance asset-liability management problem.
To determine the Lie groups that admit a flat (eventually complete) left invariant semi-Riemannian metric is an open and difficult problem. The main aim of this paper is the study of the flatness of left invariant semi Riemannian metrics on quadratic Lie groups i.e. Lie groups endowed with a bi-invariant semi Riemannia…
New method solves constrained stochastic optimization problems efficiently.
problem Online statistical inference of constrained stochastic nonlinear optimization problems.
method Stochastic Sequential Quadratic Programming (StoSQP) with iterative sketching solver.
result The rescaled primal-dual sequence converges to a mean-zero Gaussian distribution.
QENDy learns quadratic dynamics from nonlinear systems data.
problem Identifying governing equations of highly nonlinear dynamical systems.
method QENDy embeds nonlinear dynamics into a quadratic feature space, requiring trajectory data and preselected basis functions.
result QENDy accurately identifies quadratic dynamics and outperforms SINDy and deep learning methods.
New conic quadratic formulations improve outlier detection in regression models.
problem Detecting outliers in regression models with corrupted data.
method Deriving stronger second-order conic relaxations without big-M constraints.
result Proposed formulations are significantly faster than existing methods.
To estimate the conditional probability functions based on the direct problem setting, V-matrix based method was proposed. We construct V-matrix based constrained quadratic programming problems for which the inequality constraints are inconsistent. In particular, we would like to present that the constrained quadratic …
New method trains Boltzmann machines without supervision.
problem Training unsupervised learning models.
method Mixed binary quadratic feasibility problem formulation.
result Theory validated on XOR patterns.
The study examines portfolio optimization with quadratic transaction costs, complicating the optimization process.
problem Portfolio optimization with quadratic transaction costs is more challenging than with linear costs.
method Introduced numerical algorithms to solve the optimization problem with quadratic transaction costs.
result Quadratic transaction costs significantly impact the expected returns of optimized portfolios.
Algorithm reduces regret in partially observable systems by learning dynamics and using optimistic control.
problem Minimizing regret in partially observable linear quadratic control systems with unknown dynamics.
method ExpCommit algorithm that learns model parameters and uses optimism in uncertainty.
result End-to-end sublinear regret upper bound of O~(T2/3) for ExpCommit. An explicit (-1)^n-quadratic form over Z[Z^{2n}] representing the surgery problem E_8 x T^{2n} is obtained, for use in the Bryant-Ferry-Mio-Weinberger construction of 2n-dimensional exotic homology manifolds.
This paper introduces a method to incorporate risk sensitivity in RL using quadratic variation penalties.
problem Risk-sensitive reinforcement learning under entropy regularization.
method Equivalent martingale property and quadratic variation penalty for value process.
result The proposed method improves finite-sample performance in linear-quadratic control problems.
In this paper we study a continuous-time stochastic linear quadratic control problem arising from mathematical finance. We model the asset dynamics with random market coefficients and portfolio strategies with convex constraints. Following the convex duality approach, we show that the necessary and sufficient optimalit…
In this paper, we analyze a real-valued reflected backward stochastic differential equation (RBSDE) with an unbounded obstacle and an unbounded terminal condition when its generator f has quadratic growth in the z-variable. In particular, we obtain existence, comparison, and stability results, and consider the opti…
Extends quadratic loss for SVM and deep learning to improve pattern correlation.
problem Improving generalization in supervised binary classification and regression tasks.
method Extends quadratic loss, restarts from problem (8) in [3], proposes new algorithms, uses multiple kernel learning.
result Comparable results with standard losses and parameterized quadratic loss.
In this paper, we study a class of quadratic Backward Stochastic Differential Equations (BSDEs) which arises naturally when studying the problem of utility maximization with portfolio constraints. We first establish existence and uniqueness results for such BSDEs and then, we give an application to the utility maximiza…
We provide explicit solutions of certain forward-backward stochastic differential equations (FBSDEs) with quadratic growth. These particular FBSDEs are associated with quadratic term structure models of interest rates and characterize the zero-coupon bond price. The results of this paper are naturally related to simila…
New geometric Joyce structures on moduli spaces of quadratic differentials.
problem Constructing Joyce structures on moduli spaces of quadratic differentials.
method Isomonodromic deformations of second-order linear ODEs with rational potential.
result Construction of Joyce structures on moduli spaces of quadratic differentials.
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.
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.
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 d2-adic expansion instead of 4-adic for higher degree polynomials. result Provides a solution that depends on the d2-adic expansion of the power of the mapping class element. Improved SVRG for quadratic functions achieves better performance and running times.
problem Minimizing quadratic functions with a specific type of Hessian matrix.
method Variant of SVRG algorithm for quadratic functions with improved analysis.
result Improved performance and running times for quadratic functions compared to state-of-the-art methods.
Study optimal hedging for claims with random weights in discrete time.
problem Optimal hedging for claims with random weights in discrete time.
method Explicit recursive representation of optimal hedging strategy, without ND condition.
result Obtained explicit optimal hedging strategy in a recursive form.
We describe all pseudo-Riemannian metrics on closed surfaces whose geodesic flows admit nontrivial integrals quadratic in momenta. As an application, we solve the Beltrami problem on closed surfaces, prove the nonexistence of quadratically-superintegrable metrics of nonconstant curvature on closed surfaces, and prove t…
We consider the exploration-exploitation tradeoff in linear quadratic (LQ) control problems, where the state dynamics is linear and the cost function is quadratic in states and controls. We analyze the regret of Thompson sampling (TS) (a.k.a. posterior-sampling for reinforcement learning) in the frequentist setting, i.…
Note on the computational complexity of Gromov-Wasserstein distance.
problem Computational difficulty of Gromov-Wasserstein distance.
method Analysis of the optimization problem structure and providing explicit examples.
result Gromov-Wasserstein distance optimization problem is non-convex quadratic.