相关论文: Optimality conditions for minimizers at infinity i…
Multi-variable nonlinear fuzzy optimization problem is considered under linear order relation on fuzzy numbers. Using gH-differentiability of a fuzzy-valued function $\tilde{f}$, new necessary and sufficient optimality conditions are…
The finite-rank Lieb-Thirring inequality provides an estimate on a Riesz sum of the $N$ lowest eigenvalues of a Schr\"odinger operator $-\Delta-V(x)$ in terms of an $L^p(\mathbb{R}^d)$ norm of the potential $V$. We prove here the existence…
Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [IFF 2001, IO 2009].…
In this paper we present necessary and sufficient conditions (in terms of {\L}ojasiewicz inequalities) for the stability of local minimum points in smooth unconstrained optimization. In particular, we derive a sufficient condition for which…
We prove that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can test whether the optimal value of a nonlinear optimization problem where the objective and constraints are given by low-degree…
This article focuses on minimax programming problems subject to addition-{\L}ukasiewicz fuzzy relational inequalities. We first establish two necessary and sufficient conditions that a solution of the fuzzy relational inequalities is a…
When the objective function is not locally Lipschitz, constraint qualifications are no longer sufficient for Karush-Kuhn-Tucker (KKT) conditions to hold at a local minimizer, let alone ensuring an exact penalization. In this paper, we…
This paper identifies necessary and sufficient conditions for the exactness of penalty functions in optimization problems whose constraint sets are not necessarily bounded. The case where the data of problems is locally Lipschitz,…
Necessary optimality conditions in the form of the maximum principle for control problems with infinite time horizon are considered. Both finite and infinite values of objective functional are allowed since the concept of overtaking or…
Given polynomials f(x), g_i(x), h_j(x), we study how to minimize f on the semialgebraic set S = { x \in R^n: h_1(x)=...=h_{m_1}(x) =0, g_1(x) >= 0, ..., g_{m_2}(x) >= 0}. Let f_{min} be the minimum of f on S. Suppose S is nonsingular and…
Recently, finding the sparsest solution of an underdetermined linear system has become an important request in many areas such as compressed sensing, image processing, statistical learning, and data sparse approximation. In this paper, we…
In this paper we study an optimal control problem with nonsmooth mixed state and control constraints. In most of the existing results, the necessary optimality condition for optimal control problems with mixed state and control constraints…
In this paper, we study the problem of computing by relaxation hierarchies the infimum of a real polynomial function f on a closed basic semialgebraic set and the points where this infimum is reached, if they exist. We show that when the…
We employ a fuzzy optimality condition for the Frechet subdifferential and some advanced techniques of variational analysis such as formulae for the subdifferentials of an infinite family of nonsmooth functions and the coderivative…
In this paper we deal with optimality conditions that can be verified by a nonlinear optimization algorithm, where only a single Lagrange multiplier is avaliable. In particular, we deal with a conjecture formulated in [R. Andreani, J.M.…
In this paper, we propose a Newton method for unconstrained set optimization problems to find its weakly minimal solutions with respect to lower set-less ordering. The objective function of the problem under consideration is given by…
We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…
We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix $A \in [0,1]^{m \times n}$, a vector $b \in [1,\infty)^m$, and a monotone…
We introduce a unified framework for computing approximately-optimal preconditioners for solving linear and non-linear systems of equations. We demonstrate that the condition number minimization problem, under structured transformations…
Set- and vector-valued optimization problems can be re-formulated as complete lattice-valued problems. This has several advantages, one of which is the existence of a clear-cut solution concept which includes the attainment as the infimum…