Related papers: Verifiable sufficient conditions for the error bou…
In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van Geffen et al. posed this question for odd cycle transversal…
This paper presents a framework for bounding the approximation error in imitation model predictive controllers utilizing neural networks. Leveraging the Lipschitz properties of these neural networks, we derive a bound that guides dataset…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
The second-order cone linear complementarity problem (SOCLCP) is a generalization of the classical linear complementarity problem. It has been known that SOCLCP, with the globally uniquely solvable property, is essentially equivalent to a…
In this work, we consider optimality conditions of an optimal control problem governed by an obstacle problem. Here, we focus on introducing a, matrix valued, control variable as the coefficients of the obstacle problem. As it is well…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
Second-order optimality conditions are essential for nonsmooth optimization, where both the objective and constraint functions are Lipschitz continuous and second-order directionally differentiable. This paper provides no-gap second-order…
This paper is concerned with second-order optimality conditions for Tikhonov regularized optimal control problems governed by the obstacle problem. Using a simple observation that allows to characterize the structure of optimal controls on…
We consider the approximation of singularly perturbed linear second-order boundary value problems by $hp$-finite element methods. In particular, we include the case where the associated differential operator may not be coercive. Within this…
In this paper the concept of measure of noncompactness is applied to prove the existence of solution for a boundary value problem for an infinite system of second order differential equations in $\ell_{p}$ space. We change the boundary…
Estimation of solution norms and stability for time-dependent nonlinear systems is ubiquitous in numerous applied and control problems. Yet, practically valuable results are rare in this area. This paper develops a novel approach, which…
We study a cutting-plane method for semidefinite optimization problems (SDOs), and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's…
Inventory models with lost sales and large lead times have traditionally been considered intractable due to the curse of dimensionality. Recently, Goldberg and co-authors laid the foundations for a new approach to solving these models, by…
The cardinality constrained optimization problem (CCOP) is an optimization problem where the maximum number of nonzero components of any feasible point is bounded. In this paper, we consider CCOP as a mathematical program with disjunctive…
In the present paper, a systematic study is made of quantitative semicontinuity (a.k.a. Lipschitzian) properties of certain multifunctions, which are defined as a solution map associated to a family of parameterized ``split" feasibility…
We consider approximating the solution of the Helmholtz exterior Dirichlet problem for a nontrapping obstacle, with boundary data coming from plane-wave incidence, by the solution of the corresponding boundary value problem where the…
A distance-based inconsistency indicator, defined by the third author for the consistency-driven pairwise comparisons method, is extended to the incomplete case. The corresponding optimization problem is transformed into an equivalent…
In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP). However, due to…
We present a computer assisted method for generating existence proofs and a posteriori error bounds for solutions to two point boundary value problems (BVPs). All truncation errors are accounted for and, if combined with interval arithmetic…
The first order optimality conditions of optimal control problems (OCPs) can be regarded as boundary value problems for Hamiltonian systems. Variational or symplectic discretisation methods are classically known for their excellent long…