Related papers: Cardinality-constrained optimization problems in g…
In this paper, we study the perturbation analysis of a class of composite optimization problems, which is a very convenient and unified framework for developing both theoretical and algorithmic issues of constrained optimization problems.…
Rank and cardinality penalties are hard to handle in optimization frameworks due to non-convexity and discontinuity. Strong approximations have been a subject of intense study and numerous formulations have been proposed. Most of these can…
We consider a degenerate nonsmooth and nonconvex optimization problem for which the standard constraint qualification such as the generalized Mangasarian Fromovitz constraint qualification (GMFCQ) may not hold. We use smoothing functions…
Multi-objective optimization problems with constraints (CMOPs) are generally considered more challenging than those without constraints. This in part can be attributed to the creation of infeasible regions generated by the constraint…
Distributed Constraint Optimization Problems (DCOPs) have been widely used to coordinate interactions (i.e. constraints) in cooperative multi-agent systems. The traditional DCOP model assumes that variables owned by the agents can take only…
Multi-critical point principle (MPP) is one of the interesting theoretical possibilities that can explain the fine-tuning problems of the Universe. It simply claims that "the coupling constants of a theory are tuned to one of the…
This study explores B-stationarity of mathematical programs with complementarity constraints (MPCCs) and convergence behavior of MPCC algorithms. Special attention is given to the cases with biactive complementarity constraints. First, we…
The constraint nondegeneracy condition is one of the most relevant and useful constraint qualifications in nonlinear semidefinite programming. It can be characterized in terms of any fixed orthonormal basis of the, let us say,…
We study mathematical programs with switching constraints (MPSC)from the topological perspective. Two basic theorems from Morse theory are proved. Outside the W-stationary point set, continuous defor-mation of lower level sets can be…
In this paper, we focus on a class of convexly constrained nonsmooth convex-concave saddle point problems with cardinality penalties. Although such nonsmooth nonconvex-nonconcave and discontinuous min-max problems may not have a saddle…
We survey optimization problems that involve the cardinality of variable vectors in constraints or the objective function. We provide a unified viewpoint on the general problem classes and models, and give concrete examples from diverse…
We study the Cahn-Hilliard equation with non-degenerate concentration-dependent mobility and logarithmic potential in two dimensions. We show that any weak solution is unique, exhibits propagation of uniform-in-time regularity, and…
This paper investigates new first-order optimality conditions for general optimization problems. These optimality conditions are stronger than the commonly used M-stationarity conditions and are in particular useful when the latter cannot…
We investigate finite-dimensional constrained structured optimization problems, featuring composite objective functions and set-membership constraints. Offering an expressive yet simple language, this problem class provides a modeling…
This paper presents the Julia package CCOpt, built on top of the interior-point solver MadNLP. CCOpt implements a suite of algorithms for Mathematical Programs with Complementarity Constraints (MPCCs). The solver additionally comes with…
This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e. the original problem is first reformulated as a nonconvex optimization problem, its well-posedness…
There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…
A distributed nonsmooth robust resource allocation problem with cardinality constrained uncertainty is investigated in this paper. The global objective is consisted of local objectives, which are convex but nonsmooth. Each agent is…
We prove global regularity, scattering and a priori bounds for the energy critical Maxwell-Klein-Gordon equation relative to the Coulomb gauge on (1+4)-dimensional Minkowski space. The proof is based upon a modified Bahouri-Gerard profile…
The degeneracy of central configurations in the planar $N$-body problem makes their enumeration problem hard and the related dynamics appealing. To truly understand the bifurcations of central configurations, we should work in the FULL…