Results 11 to 20 of about 17,832 (262)
In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function. We prove that a global solution of the problem can be approximated by an exact or an inexact solution ...
Pierre Maréchal, Jane J. Ye
openaire +3 more sources
In the traditional nonlinear optimization theory, the Karush-Kuhn-Tucker (KKT) optimality conditions for constrained optimization problems with inequality constraints play an essential role.
Md Sadikur Rahman +4 more
doaj +1 more source
Optimality Conditions in Quasidifferentiable Vector Optimization [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Global Optimality Conditions for Nonlinear Programming Problems with Linear Equality Constraints
Some necessary global optimality conditions and sufficient global optimality conditions for nonconvex minimization problems with a quadratic inequality constraint and a linear equality constraint are derived.
Guoquan Li, Yan Wang
doaj +1 more source
Optimality conditions for interval-valued univex programming
We introduce concepts of interval-valued univex mappings, consider optimization conditions for interval-valued univex functions for the constrained interval-valued minimization problem, and show examples for the illustration purposes.
Lifeng Li, Jianke Zhang, Chang Zhou
doaj +1 more source
Optimality Conditions for Constrained Minimax Optimization
17 ...
Dai, Yu-Hong, Zhang, Liwei
openaire +4 more sources
Optimality Conditions for the Principle of Trajectory Division
This paper considers the problem of controlling a mobile robot in the presence of circular obstacles. To solve this problem, it is proposed to use the previously suggested principle of dividing permissible trajectories into a sequence of rectilinear ...
Valentin Bereznev
doaj +1 more source
Kuhn-Tucker Optimality Conditions for Vector Equilibrium Problems
By using the concept of Fréchet differentiability of mapping, we present the Kuhn-Tucker optimality conditions for weakly efficient solution, Henig efficient solution, superefficient solution, and globally efficient solution to the vector ...
Wei Zhen-Fei, Gong Xun-Hua
doaj +2 more sources
Optimality Conditions for ε-Vector Equilibrium Problems
By virtue of the separation theorem of convex sets, a necessary condition and a sufficient condition for ε-vector equilibrium problem with constraints are obtained. Then, by using the Gerstewitz nonconvex separation functional, a necessary and sufficient
Lu Wei-zhong, Huang Shou-jun, Yang Jun
doaj +1 more source
Optimality Conditions for Group Sparse Constrained Optimization Problems
In this paper, optimality conditions for the group sparse constrained optimization (GSCO) problems are studied. Firstly, the equivalent characterizations of Bouligand tangent cone, Clarke tangent cone and their corresponding normal cones of the group ...
Wenying Wu, Dingtao Peng
doaj +1 more source

