相关论文: Cardinality-constrained optimization problems in g…
The well-posedness of a class of optimal control problems is analysed, where the state equation couples a nonlinear degenerate Fokker-Planck equation with a system of Ordinary Differential Equations (ODEs). Such problems naturally arise as…
We consider the linear complementarity problem with uncertain data modeled by intervals, representing the range of possible values. Many properties of the linear complementarity problem (such as solvability, uniqueness, convexity, finite…
Distributed Constraint Optimization Problems (DCOPs) are a widely studied framework for coordinating interactions in cooperative multi-agent systems. In classical DCOPs, variables owned by agents are assumed to be discrete. However, in many…
Conformal prediction (CP) provides finite-sample, distribution-free marginal coverage, but standard conformal regression intervals can be inefficient under heteroscedasticity and skewness. In particular, popular constructions such as…
We show that the Mordukhovich-stationarity system associated with a mathematical program with complementarity constraints (MPCC) can be equivalently written as a system of discontinuous equations which can be tackled with a semismooth…
We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly…
The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained…
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control con- straints and cost are all described by polynomials, and more generally for OCPs with smooth…
A memory-efficient framework is described for the cardinality-constrained structured data-fitting problem. Dual-based atom-identification rules are proposed that reveal the structure of the optimal primal solution from near-optimal dual…
This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…
This is the second paper in our sequence. Here, we apply our abstract Morse index formulation developed in the previous paper to study several optimization set-ups with constraints, including type I or/and type II considerations. A common…
Combinatorial optimization (CO) is naturally discrete, making machine learning based on differentiable optimization inapplicable. Karalias & Loukas (2020) adapted the probabilistic method to incorporate CO into differentiable optimization.…
Cardinality estimation is a fundamental task in database management systems, aiming to predict query results accurately without executing the queries. However, existing techniques either achieve low estimation accuracy or incur high…
Improving renewable energy resource utilization efficiency is crucial to reducing carbon emissions, and multi-parametric programming has provided a systematic perspective in conducting analysis and optimization toward this goal in smart…
The concentration compactness framework for semilinear elliptic equations without compactness, set originally by P.-L.Lions for constrained minimization in the case of homogeneous nonlinearity, is extended here to the case of general…
Mixed-Integer Second-Order Cone Programs (MISOCPs) form a nice class of mixed-inter convex programs, which can be solved very efficiently due to the recent advances in optimization solvers. Our paper bridges the gap between modeling a class…
Combinatorial bilevel congestion pricing (CBCP), a variant of the mixed (continuous/discrete) network design problems, seeks to minimize the total travel time experienced by all travelers in a road network, by strategically selecting toll…
As a starting point of our research, we show that, for a fixed order $\gamma\geq 1$, each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to…
Given a constraint satisfaction problem (CSP) on $n$ variables, $x_1, x_2, \dots, x_n \in \{\pm 1\}$, and $m$ constraints, a global cardinality constraint has the form of $\sum_{i = 1}^{n} x_i = (1-2p)n$, where $p \in (\Omega(1), 1 -…
We study the compactification of nonautonomous systems with autonomous limits and related dynamics. Although the $C^{1}$ extension of the compactification was well established, a great number of problems arising in bifurcation and stability…