OPTIMALITY_CONDITIONS

作品数：64被引量：80H指数：5
导出分析报告
相关作者：冯强王荣波张庆祥更多>>
相关机构：延安大学南昌大学更多>>
相关期刊：《Computer Modeling in Engineering & Sciences》《Journal of Computational Mathematics》《Applied Mathematics and Mechanics(English Edition)》《Journal of Systems Science and Systems Engineering》更多>>
相关基金：国家自然科学基金山东省自然科学基金中国博士后科学基金陕西省教育厅科研计划项目更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Journal of the Operations Research Society of Chinax
共 条 记 录，以下是1-8
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Optimality Conditions for Generalized Convex Nonsmooth Uncertain Multi-objective Fractional Programming
《Journal of the Operations Research Society of China》2023年第4期809-826,共18页Xiao Pan Guo-Lin Yu Tian-Tian Gong 
supported by Natural Science Foundation of China(Nos.11861002 and 12171601);the Key Project of North Minzu University(No.ZDZX201804);the Construction Project of First-Class Disciplines in Ningxia Higher Education(NXYLXK2017B09);the Postgraduate Innovation Project of North Minzu Universit(No.YCX21157)..
This paper aims at studying optimality conditions of robust weak efficient solutions for a nonsmooth uncertain multi-objective fractional programming problem(NUMFP).The concepts of two types of generalized convex func...
关键词：Multi-objective fractional programming Robust weak efficient solution Generalized convex function Optimality condition Saddle point 
Approximate Weak Minimal Solutions of Set-Valued Optimization Problems
《Journal of the Operations Research Society of China》2023年第3期673-692,共20页S.Khoshkhabar-amiranloo 
Institute for Research in Fundamental Sciences(No.96580048).
This paper deals with approximate weak minimal solutions of set-valued optimization problems under vector and set optimality criteria.The relationships between various concepts of approximate weak minimal solutions ar...
关键词：Set-valued optimization Approximate weak minimal solutions Existence theorems Optimality conditions Scalarization functions 
Optimality Conditions for Rank-Constrained Matrix Optimization
《Journal of the Operations Research Society of China》2019年第2期285-301,共17页Xin-Rong Li Wen Song Nai-Hua Xiu 
This research was supported by the National Natural Science Foundation of China(Nos.11431002 and 11371116).
In this paper,we comprehensively study optimality conditions for rank-constrained matrix optimization(RCMO).By calculating the Clarke tangent and normal cones to a rank-constrained set,along with the given Fréchet,Mo...
关键词：Matrix optimization Rank constraint Normal cone First-order optimality condition Second-order optimality condition 
Second-Order Optimality Conditions for Multiobjective Optimization Whose Order Induced by Second-Order Cone被引量：1
《Journal of the Operations Research Society of China》2018年第2期267-288,共22页Li-Wei Zhang Ji-Hong Zhang Yu-Le Zhang 
This work was supported by the National Natural Science Foundation of China(Nos.11571059,11731013 and 91330206).
This paper is devoted to developing first-order necessary,second-order necessary,and second-order sufficient optimality conditions for a multiobjective optimization problem whose order is induced by a finite product o...
关键词：Second-order cone-induced multiobjective optimization Optimality conditions Polyhedral cone Second-order cone Semi-definite cone 
Optimality Conditions of Approximate Solutions for Nonsmooth Semi-infinite Programming Problems被引量：7
《Journal of the Operations Research Society of China》2018年第2期289-299,共11页Xian-Jun Long Yi-Bin Xiao Nan-Jing Huang 
This work was partially supported by the National Natural Science Foundation of China(Nos.11471059 and 11671282);the Chongqing Research Program of Basic Research and Frontier Technology(Nos.cstc2014jcyjA00037,cstc2015jcyjB00001 and cstc2014jcyjA00033);the Education Committee Project Research Foundation of Chongqing(Nos.KJ1400618 and KJ1400630);the Program for University Innovation Team of Chongqing(No.CXTDX201601026);the Education Committee Project Foundation of Bayu Scholar.
In this paper,we study optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems.Three new classes of functions,namelyε-pseudoconvex functions of type I and type II andε-quasico...
关键词：Nonsmooth semi-infinite programming problem Optimality condition Approximate solution Generalized pseudoconvexity 
Approximate Optimality Conditions for Composite Convex Optimization Problems被引量：3
《Journal of the Operations Research Society of China》2017年第4期469-485,共17页Xian-Jun Long Xiang-Kai Sun Zai-Yun Peng 
the National Natural Science Foundation of China(Nos.11471059,11301571,and 11301570);the Chongqing Research Program of Basic Research and Frontier Technology(Nos.cstc2014jcyjA00037,cstc2015jcyjB00001,cstc2015jcyjA00025,and cstc2015jcyjA00002);the Education Committee Project Research Foundation of Chongqing(Nos.KJ1400618 and KJ1500626);the Postdoctoral Science Foundation of China(Nos.2015M580774 and 2016T90837);the Program for University Innovation Team of Chongqing(CXTDX201601026 and CXTDX201601022).
The purpose of this paper is to study the approximate optimality condition for composite convex optimization problems with a cone-convex system in locally convex spaces,where all functions involved are not necessaril...
关键词：Composite convex optimization problem Approximate optimality condition Generalized regularity condition ε-Subdifferential 
Optimization Methods for Box-Constrained Nonlinear Programming Problems Based on Linear Transformation and Lagrange Interpolating Polynomials
《Journal of the Operations Research Society of China》2017年第2期193-218,共26页Zhi-You Wu Fu-Sheng Bai Jing Tian 
the National Natural Science Foundation of China(No.11471062).
In this paper,an optimality condition for nonlinear programming problems with box constraints is given by using linear transformation and Lagrange interpolating polynomials.Based on this condition,two new local optim...
关键词：Nonlinear programming Optimality conditions Linear transformation Lagrange interpolating polynomials Global optimization method 
An Exact l(1) Penalty Approach for Interval-Valued Programming Problem
《Journal of the Operations Research Society of China》2016年第4期461-481,共21页Anurag Jayswal Jonaki Banerjee 
the Department of Science and Technology,New Delhi,India(No.SR/FTP/MS-007/2011).
The objective of this paper is to propose an exact l1 penalty method for constrained interval-valued programming problems which transform the constrained problem into an unconstrained interval-valued penalized optimiz...
关键词：Exact l1 penalty method Interval-valued programming CONVEXITY LU optimal Optimality conditions Saddle-points 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部