咨询与建议

限定检索结果

文献类型

  • 17 篇 期刊文献
  • 1 篇 学位论文
  • 1 篇 会议

馆藏范围

  • 19 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 15 篇 理学
    • 15 篇 数学
    • 1 篇 物理学
  • 6 篇 管理学
    • 6 篇 管理科学与工程(可...
  • 4 篇 工学
    • 2 篇 控制科学与工程
    • 2 篇 计算机科学与技术...
    • 1 篇 信息与通信工程

主题

  • 19 篇 nonconvex optimi...
  • 4 篇 computational si...
  • 4 篇 local search
  • 3 篇 optimistic solut...
  • 3 篇 bilevel programm...
  • 3 篇 global convergen...
  • 2 篇 moving horizon e...
  • 2 篇 model predictive...
  • 2 篇 embedded numeric...
  • 2 篇 global search
  • 2 篇 rust
  • 2 篇 convergence
  • 2 篇 robot operating ...
  • 2 篇 code generation
  • 1 篇 peaceman-rachfor...
  • 1 篇 sparse polynomia...
  • 1 篇 nesterov acceler...
  • 1 篇 broyden family m...
  • 1 篇 competing struct...
  • 1 篇 convex optimizat...

机构

  • 2 篇 russian acad sci...
  • 2 篇 guangxi univ col...
  • 1 篇 naresuan univ fa...
  • 1 篇 russian acad sci...
  • 1 篇 queens univ belf...
  • 1 篇 natl univ mongol...
  • 1 篇 tokyo inst techn...
  • 1 篇 queens univ belf...
  • 1 篇 nanjing univ sch...
  • 1 篇 guangxi univ nat...
  • 1 篇 university of ca...
  • 1 篇 inst syst dynam ...
  • 1 篇 katholieke univ ...
  • 1 篇 naresuan univ re...
  • 1 篇 kazan typolev st...
  • 1 篇 widefind ab auro...
  • 1 篇 ecole natl ingn ...
  • 1 篇 widefind ab auro...
  • 1 篇 purdue univ dept...
  • 1 篇 1. international...

作者

  • 2 篇 strekalovsky ale...
  • 2 篇 strekalovsky a. ...
  • 2 篇 malyshev a. v.
  • 2 篇 orlov a. v.
  • 1 篇 orlov andrei v.
  • 1 篇 chao mian tao
  • 1 篇 huang yesheng
  • 1 篇 kojima masakazu
  • 1 篇 piccoli b
  • 1 篇 bian fengmiao
  • 1 篇 batbileg s.
  • 1 篇 li min
  • 1 篇 liu tianxiang
  • 1 篇 zhang ye
  • 1 篇 panagiotis patri...
  • 1 篇 patrinos panagio...
  • 1 篇 crasta g
  • 1 篇 malyshev anton v...
  • 1 篇 toscano rosario
  • 1 篇 fresk emil

语言

  • 16 篇 英文
  • 3 篇 其他
检索条件"主题词=Nonconvex optimization problems"
19 条 记 录,以下是1-10 订阅
排序:
Peaceman-Rachford splitting for a class of nonconvex optimization problems
收藏 引用
COMPUTATIONAL optimization AND APPLICATIONS 2017年 第2期68卷 407-436页
作者: Li, Guoyin Liu, Tianxiang Pong, Ting Kei Univ New South Wales Dept Appl Math Sydney NSW 2052 Australia Hong Kong Polytech Univ Dept Appl Math Hong Kong Hong Kong Peoples R China
We study the applicability of the Peaceman-Rachford (PR) splitting method for solving nonconvex optimization problems. When applied to minimizing the sum of a strongly convex Lipschitz differentiable function and a pr... 详细信息
来源: 评论
Convergence Analysis of the Generalized Splitting Methods for a Class of nonconvex optimization problems
收藏 引用
JOURNAL OF optimization THEORY AND APPLICATIONS 2019年 第2期183卷 535-565页
作者: Li, Min Wu, Zhongming Nanjing Univ Sch Management & Engn Nanjing 210093 Jiangsu Peoples R China Southeast Univ Sch Econ & Management Nanjing 210096 Jiangsu Peoples R China
In this paper, we propose generalized splitting methods for solving a class of nonconvex optimization problems. The new methods are extended from the classic Douglas-Rachford and Peaceman-Rachford splitting methods. T... 详细信息
来源: 评论
Regularized Nesterov's accelerated damped BFGS method for stochastic optimization
收藏 引用
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2025年 467卷
作者: Suppalap, Siwakon Makmuang, Dawrawee Damminsed, Vipavee Wangkeeree, Rabian Naresuan Univ Fac Sci Dept Math Phitsanulok 65000 Thailand Naresuan Univ Res Ctr Acad Excellence Math Phitsanulok 65000 Thailand
A regularization term is introduced into the approximate Hessian update in the stochastic Broyden-Fletcher-Goldfarb-Shanno (BFGS) method for convex stochastic optimization problems to help avoid near-singularity issue... 详细信息
来源: 评论
On computational search for Nash equilibrium in hexamatrix games
收藏 引用
optimization LETTERS 2016年 第2期10卷 369-381页
作者: Orlov, Andrei V. Strekalovsky, Alexander S. Batbileg, S. Inst Syst Dynam & Control Theory SB RAS Lermontov Str 134 Irkutsk 664033 Russia Natl Univ Mongolia Baga Toiruu 4 Ulaanbaatar Mongolia
The problem of numerical finding of a Nash equilibrium in a 3-player polymatrix game is considered. Such a game can be completely described by six matrices, and it turns out to be equivalent to the solving a nonconvex... 详细信息
来源: 评论
On computational search for optimistic solutions in bilevel problems
收藏 引用
JOURNAL OF GLOBAL optimization 2010年 第1期48卷 159-172页
作者: Strekalovsky, Alexander S. Orlov, Andrey V. Malyshev, Anton V. ISDCT SB RAS Irkutsk Russia
The linear-linear and quadratic-linear bilevel programming problems are considered. Their optimistic statement is reduced to a nonconvex mathematical programming problem with the bilinear structure. Approximate algori... 详细信息
来源: 评论
BANG-BANG PROPERTY FOR BOLZA problems IN 2 DIMENSIONS
收藏 引用
JOURNAL OF optimization THEORY AND APPLICATIONS 1994年 第1期83卷 155-165页
作者: CRASTA, G PICCOLI, B 1. International School for Advanced Studies Trieste Italy
Consider the following Bolza problem: min integral h(x, u)dt, x = F(x) + uG(x), \u\ less-than-or-equal-to 1, x is-an-element-of OMEGA subset-of R2, x(0) = x0, x(1) = x1. We show that, under suitable assumptions on F, ... 详细信息
来源: 评论
A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems
收藏 引用
CALCOLO 2020年 第4期57卷 35-35页
作者: Yuan, Gonglin Wang, Zhan Li, Pengyuan Guangxi Univ Coll Math & Informat Sci Nanning Peoples R China
The Quasi-Newton method is one of the most effective methods using the first derivative for solving all unconstrained optimization problems. The Broyden family method plays an important role among the quasi-Newton alg... 详细信息
来源: 评论
Solving polynomial least squares problems via semidefinite programming relaxations
收藏 引用
JOURNAL OF GLOBAL optimization 2010年 第1期46卷 1-23页
作者: Kim, Sunyoung Kojima, Masakazu Ewha Womans Univ Dept Math Seoul 120750 South Korea Tokyo Inst Technol Dept Math & Comp Sci Meguro Ku Tokyo 1528552 Japan
A polynomial optimization problem whose objective function is represented as a sum of positive and even powers of polynomials, called a polynomial least squares problem, is considered. Methods to transform a polynomia... 详细信息
来源: 评论
Local Search in a Quadratic-Linear Bilevel Programming Problem
收藏 引用
NUMERICAL ANALYSIS AND APPLICATIONS 2010年 第1期3卷 59-70页
作者: Strekalovsky, A. S. Orlov, A. V. Malyshev, A. V. Russian Acad Sci Inst Syst Dynam & Control Theory Siberian Branch Ul Lermontova 134 Irkutsk 664033 Russia
A quadratic-linear bilevel programming problem is considered. Its optimistic statement is reduced to a nonconvex mathematical programming problem with a quadratic-bilinear structure. An approximate algorithm of a loca... 详细信息
来源: 评论
Numerical Solution of a Class of Bilevel Programming problems
收藏 引用
NUMERICAL ANALYSIS AND APPLICATIONS 2010年 第2期3卷 165-173页
作者: Strekalovsky, A. S. Orlov, A. V. Malyshev, A. V. Russian Acad Sci Inst Syst Dynam & Control Theory Siberian Branch Ul Lermontova 134 Irkutsk 664033 Russia
A quadratic-linear bilevel programming problem is considered. Its optimistic statement is reduced to a series of nonconvex unilevel problems. An approximate algorithm for global search in reduced problems is proposed.... 详细信息
来源: 评论