搜索结果: 1-10 共查到“运筹学 I-method”相关记录10条 . 查询时间(0.125 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：A Squared Smoothing Newton Method for Semidefinite Programming
半定规划 平方平滑 牛顿方法
2023/4/14
This paper proposes a squared smoothing Newton method via the Huber smoothing function for solving semidefinite programming problems (SDPs). We first study the fundamental properties of the matrix-val...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Global and Local Convergence-Rate Analysis of an Inexact Newton Augmented Lagrangian Method for Zero-One Composite Optimization
零一复合优化 不精确 牛顿增强拉格朗日方法 收敛率分析
2023/4/14
Zero-One Composite Optimization (0/1-COP) is a prototype of nonsmooth, non- convex optimization problems and it has attracted much attention recently. Augmented Lagrangian Method (ALM) has stood out a...
山东大学数学学院运筹学英文课件chap3 The Simplex Method and Sensitivity Analysis
山东大学数学学院 运筹学 英文课件 chap3 The Simplex Method and Sensitivity Analysis
2017/4/21
山东大学数学学院运筹学英文课件chap3 The Simplex Method and Sensitivity Analysis。
A primal-dual potential reduction method for problems involving matrix inequalities
Interior point algorithms Linear matrix inequaliües Semidefinite programming
2015/8/11
We describe a potential reduction method for convex optimization problems involving matrix inequalities. The method is based on the theory developed by Nesterov and Nemirovsky and generalizes Gonzaga ...
Sub-Supersolution Method for a Class of Higher Order Evolution Hemivariational
Evolution hemivariational inequality sub-solution super-solution extremal solution sub-supersolution method
2011/11/17
In this paper, we extend extremality results for the variational inequality to a higher order evolution hemivariational inequality. More precisely, we give an existence theorem of solution for the hig...
Convergence of the Gauss-Newton method for convex composite optimization under a majorant condition
the Gauss-Newton method convex composite optimization Optimization and Control
2011/9/15
Abstract: Under the hypothesis that an initial point is a quasi-regular point, we use a majorant condition to present a new semi-local convergence analysis of an extension of the Gauss-Newton method f...
A global Monte-Carlo method for fitting parameters of differential equation models
global Monte-Carlo method fitting parameters Quantitative Methods
2011/10/8
Abstract: Finding the parameter values of differential equation models from data is an important part of the modelling process. Large models and sparse data often make the parameters very difficult to...
Systematic method of generating new integrable systems via inverse Miura maps
modified integrable systems Lax representation
2011/3/2
We provide a new natural interpretation of the Lax representation for an integrable system; that is, the spectral problem is the linearized form of a Miura transformation between the original system a...
Design of Easily Synchronizable Oscillator Networks Using the Monte Carlo Optimization Method
Synchronization Kuramoto model Networks Metropolis Optimization
2010/4/21
Starting with an initial random network of oscillators with a heterogeneous frequency distribution, its autonomous synchronization ability can be largely improved by appropriately rewiring the links b...
In this paper, a modification of the bisection simplex
method$^{[7]}$ is made for more general purpose use. Organized in an
alternative simpler form, the modified version exploits information of the...