Results 11 to 20 of about 12,928 (140)
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract Autonomous vehicles are required to operate in an uncertain environment. Recent advances in computational intelligence techniques make it possible to understand driving scenes in various environments by using a semantic segmentation neural network, which assigns a class label to each pixel.
Yining Hua +4 more
wiley +1 more source
, 2023 We introduce a new analytic framework to analyze the convergence of the Randomized Stochastic Gradient Descent Ascent (RSGDA) algorithm for stochastic minimax optimization problems. Under the so-called NC-PL condition on one of the variables, our analysis improves the state-of-the-art convergence results in the current literature and hence broadens the
Liu, Zehua +3 more
openaire +2 more sources
An Algorithm for Global Maximization of Secrecy Rates in Gaussian MIMO Wiretap Channels [PDF]
, 2015 Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the proof of the optimality of ...
Charalambous, Charalambos D. +1 more
core +1 more source
Generalized Minimax Programming with Nondifferentiable (G, β)-Invexity
Journal of Applied Mathematics, 2013 We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex. Not only G-sufficient but also G-necessary optimality conditions are established for problem (P ...
D. H. Yuan, X. L. Liu
doaj +1 more source
On Nonsmooth Semi-Infinite Minimax Programming Problem with (Φ,ρ)-Invexity
Abstract and Applied Analysis, 2014 We are interested in a nonsmooth minimax programming Problem (SIP). Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem.
X. L. Liu +3 more
doaj +1 more source
Maximum principle and second-order conditions for minimax problems of optimal control
Journal of Optimization Theory and Applications, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arutyunov A.V. +2 more
openaire +3 more sources
Global Solutions to Nonconvex Optimization of 4th-Order Polynomial and Log-Sum-Exp Functions [PDF]
, 2014 This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences.
Chen, Yi, Gao, David Y
core +1 more source
Optimality conditions and duality for minimax fractional programming problems with data uncertainty
Journal of Industrial and Management Optimization, 2019 In this paper, we consider minimax nondifferentiable fractional programming problems with data uncertainty in both the objective and constraints. Via robust optimization, we establish the necessary and sufficient optimality conditions for an uncertain minimax convex-concave fractional programming problem under the robust subdifferentiable constraint ...
Xiao-Bing Li, Qi-Lin Wang, Zhi Lin
openaire +1 more source
A Stochastic Interpretation of Stochastic Mirror Descent: Risk-Sensitive Optimality [PDF]
, 2019 Stochastic mirror descent (SMD) is a fairly new family of algorithms that has recently found a wide range of applications in optimization, machine learning, and control. It can be considered a generalization of the classical stochastic gradient algorithm
Azizan, Navid, Hassibi, Babak
core +2 more sources
A Minimax-Program-Based Approach for Robust Fractional Multi-Objective Optimization
MathematicsIn this paper, by making use of some advanced tools from variational analysis and generalized differentiation, we establish necessary optimality conditions for a class of robust fractional minimax programming problems.
Henan Li, Zhe Hong, Do Sang Kim
doaj +1 more source