The study of positive definiteness of an even degree multivariate form arises from stability study of nonlinear autonomous systems via Liapunov’s direct method in automatic control and many other appl
The study of positive definiteness of an even degree multivariate form arises from stability study of nonlinear autonomous systems via Liapunov’s direct method in automatic control and many other appl
We consider a convex MPEC problem with a nondifferentiable convex objective function and constraints separable in two variable vectors whose second variable vector belongs to the set of optimal soluti
We consider a convex MPEC problem with a nondifferentiable convex objective function and constraints separable in two variable vectors whose second variable vector belongs to the set of optimal soluti
Two classes of generalized vector variational-like inequalities in Banach spaces are introduced, which include several vector variational inequalities as special cases. By virtue of Nadler lemma and c
Two classes of generalized vector variational-like inequalities in Banach spaces are introduced, which include several vector variational inequalities as special cases. By virtue of Nadler lemma and c
In this paper, the nonlinear minimax problems with general constraints are considered. With the help of pivoting operation, an improved direction is yielded by employing one Quadratic Programming (QP)
In this paper, the nonlinear minimax problems with general constraints are considered. With the help of pivoting operation, an improved direction is yielded by employing one Quadratic Programming (QP)
In this paper we present a sequential quadratically constrained quadratic programming (SQCQP) norm-relaxed algorithm of strongly sub-feasible directions for the solution of inequality constrained opti
In this paper we present a sequential quadratically constrained quadratic programming (SQCQP) norm-relaxed algorithm of strongly sub-feasible directions for the solution of inequality constrained opti
In this paper, a class of finely discretized Semi-Infinite Programming (SIP) problems is discussed. Combining the idea of the norm-relaxed Method of Feasible Directions (MFD) and the technique of upda
In this paper, a class of finely discretized Semi-Infinite Programming (SIP) problems is discussed. Combining the idea of the norm-relaxed Method of Feasible Directions (MFD) and the technique of upda
In this paper, we propose a feasible sequential system of linear equations algorithm for minimizing an SC^1 function subject to inequality constraints. The distinguishing features of the proposed algo
In this paper, we propose a feasible sequential system of linear equations algorithm for minimizing an SC^1 function subject to inequality constraints. The distinguishing features of the proposed algo
In this paper, a sequential quadratically constrained quadratic programming method of feasible directions is proposed for the optimization problems with nonlinear inequality constraints. At each itera
In this paper, a sequential quadratically constrained quadratic programming method of feasible directions is proposed for the optimization problems with nonlinear inequality constraints. At each itera
In this paper, the nonlinear minimax problems with inequality constraints are discussed, and a sequential quadratic programming (SQP) algorithm with a generalized monotone line search is presented. At
In this paper, the nonlinear minimax problems with inequality constraints are discussed, and a sequential quadratic programming (SQP) algorithm with a generalized monotone line search is presented. At
In this talk, we provide the separation theorems and the approximate project theorem for nonconvex closed sets in Banach spaces. As application, we present Lagrange multiplizer rules for multiobjectiv
In this talk, we provide the separation theorems and the approximate project theorem for nonconvex closed sets in Banach spaces. As application, we present Lagrange multiplizer rules for multiobjectiv
暂无评论