相关论文: Cardinality-constrained optimization problems in g…
The constrained gradient method (CGM) has recently been proposed to solve convex optimization and monotone variational inequality (VI) problems with general functional constraints. While existing literature has established convergence…
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an additional requirement that prescribes how many variables must…
We study the robustness of the steady states of a class of systems of autonomous ordinary differential equations (ODEs), having as a central example those arising from (bio)chemical reaction networks. More precisely, we study under what…
Working under large cardinal assumptions, we study the Borel-reducibility between equivalence relations modulo restrictions of the non-stationary ideal on some fixed cardinal $\kappa$. We show the consistency of…
This paper introduces and studies the generalized optimization problem (for short, GOP) defined by the conic order relation on a local sphere. The existence of solution to this problem is studied by using image space analysis (for short,…
We improve previous work on the consistency strength of mutually stationary sequences of sets concentrating on points with divergent cofinality building on previous work by Adolf, Cox and Welch. Specifically, we have greatly reduced our…
This article is devoted to investigate a nonsmooth/nonconvex uncertain multiobjective optimization problem with composition fields (CUP) for brevity) over arbitrary Asplund spaces. Employing some advanced techniques of variational analysis…
The Constraint Satisfaction Problem (CSP) has been intensively studied in many areas of computer science and mathematics. The approach to the CSP based on tools from universal algebra turned out to be the most successful one to study the…
Dynamic constrained optimization problems (DCOPs) have gained researchers attention in recent years because a vast majority of real world problems change over time. There are studies about the effect of constrained handling techniques in…
In this paper, we study the norm-based robust (efficient) solutions of a Vector Optimization Problem (VOP). We define two kinds of non-ascent directions in terms of Clarke's generalized gradient and characterize norm-based robustness by…
This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity. A classical…
For statistical modeling wherein the data regime is unfavorable in terms of dimensionality relative to the sample size, finding hidden sparsity in the ground truth can be critical in formulating an accurate statistical model. The so-called…
Several real-world applications could be modeled as Mixed-Integer Non-Linear Programming (MINLP) problems, and some prominent examples include portfolio optimization, remote sensing technology, and so on. Most of the models for these…
Given a semistable degeneration with a simple normal crossings central fiber, Abramovich-Chen-Gross-Siebert [3] proved a degeneration formula that relates the moduli spaces of stable maps in smooth fibers to certain moduli spaces of…
This paper surveys various results about Markov chains on general (non-countable) state spaces. It begins with an introduction to Markov chain Monte Carlo (MCMC) algorithms, which provide the motivation and context for the theory which…
Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a consequence, basic…
While coresets have been growing in terms of their application, barring few exceptions, they have mostly been limited to unsupervised settings. We consider supervised classification problems, and non-decomposable evaluation measures in such…
We study non-variational degenerate elliptic equations with high order singular structures. No boundary data are imposed and singularities occur along an {\it a priori} unknown interior region. We prove that positive solutions have a…
We determine the generic consistency, dimension and nondegeneracy of the zero locus over $\mathbb{C}^*$, $\mathbb{R}^*$ and $\mathbb{R}_{>0}$ of vertically parametrized systems: parametric polynomial systems consisting of linear…
We investigate degenerate saddle point problems, which can be viewed as limit cases of standard mixed formulations of symmetric problems with large jumps in coefficients. We prove that they are well-posed in a standard norm despite the…