检索结果-内蒙古大学图书馆

arXiv 2023年

作者： Alacaoglu, Ahmet Wright, Stephen J. Wisconsin Institute for Discovery University of Wisconsin–Madison United States Department of Computer Sciences University of Wisconsin–Madison United States

We analyze the complexity of single-loop quadratic penalty and augmented Lagrangian algorithms for solving nonconvex optimization problems with functional equality constraints. We consider three cases, in all of which the objective is stochastic and smooth, that is, an expectation over an unknown distribution that is accessed by sampling. The nature of the equality constraints differs among the three cases: deterministic and linear in the first case, deterministic, smooth and nonlinear in the second case, and stochastic, smooth and nonlinear in the third case. Variance reduction techniques are used to improve the complexity. To find a point that satisfies Ε-approximate first-order conditions, we require Oe(Ε−3) complexity in the first case, Oe(Ε−4) in the second case, and Oe(Ε−5) in the third case. For the first and third cases, they are the first algorithms of "single loop" type (that also use O(1) samples at each iteration) that still achieve the best-known complexity guarantees. Copyright © 2023, The Authors. All rights reserved.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Growing Convex Collision-Free Regions in Configuration Space using nonlinear programming

arXiv

引用

arXiv 2023年

作者： Petersen, Mark Tedrake, Russ School of Engineering and Applied Sciences Harvard University CambridgeMA02138-2933 United States Computer Science & Artificial Intelligence Laboratory MIT CambridgeMA02139-4309 United States

One of the most difficult parts of motion planning in configuration space is ensuring a trajectory does not collide with task-space obstacles in the environment. Generating regions that are convex and collision free in configuration space can separate the computational burden of collision checking from motion planning. To that end, we propose an extension to IRIS (Iterative Regional Inflation by Semidefinite programming) [5] that allows it to operate in configuration space. Our algorithm, IRIS-NP (Iterative Regional Inflation by Semidefinite & nonlinear programming), uses nonlinear optimization to add the separating hyperplanes, enabling support for more general nonlinear constraints. Developed in parallel to Amice et al. [1], IRIS-NP trades rigourous certification that regions are collision free for probabilistic certification and the benefit of faster region generation in the configuration-space coordinates. IRIS-NP also provides a solid initialization to C-IRIS to reduce the number of iterations required for certification. We demonstrate that IRIS-NP can scale to a dual-arm manipulator and can handle additional nonlinear constraints using the same machinery. Finally, we show ablations of elements of our implementation to demonstrate their importance. © 2023, CC BY.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

This paper presents a new application of Borsuk-Ulam's theorem to nonlinear programming

arXiv

引用

arXiv 2023年

作者： Kawasaki, Hidefumi Faculty of Mathematics Kyushu University Motooka 744 Nishi-ku Fukuoka819-0395 Japan

Borsuk-Ulam’s theorem is a useful tool of algebraic topology. It states that for any continuous mapping f from the n-sphere to the n-dimensional Euclidean space, there exists a pair of antipodal points such that f(x) = f(−x). As for its applications, ham-sandwich theorem, necklace theorem and coloring of Kneser graph by Lovász are well-known. This paper attempts to apply Borsuk-Ulam’s theorem to nonlinear *** Codes 90C31, 55M20 Copyright © 2023, The Authors. All rights reserved.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Duality under novel generalizations of the D-type-I functions for multiple objective nonlinear programming problems

引用

SCIENTIFIC AFRICAN 2024年 23卷

作者： Kassem, Mohamed Abd El-Hady Rathour, Laxmi Tanta Univ Fac Sci Math Dept Tanta Egypt Natl Inst Technol Dept Math Aizawl 796012 Mizoram India

In this paper, we provide novel generalizations of the D-type-I functions by relaxing the D-Preinvexity functions using the mean-valued theorem. Under these new generalizations of the DPreinvexity type-I functions, we also study the optimality solutions for multiple objective nonlinear programming problems. We also establish and illustrate the duality theorems (weak, strong, and converse) for the Wolf-type and Mond-Weir-type for multiple objective nonlinear programming problems using these new generalizations of the D-Preinvexity type-I functions.

关键词： Multiple objective programming nonlinear programming Duality theorems Preinvexity functions Type -I functions

来源：评论

学校读者我要写书评

暂无评论

Improved Algorithm for nonlinear programming with Inequality Constraints Based on Big Data Framework 2

Improved Algorithm for Nonlinear Programming with Inequality...

引用

2nd International Conference on Computing and Data Science, CONF-CDS 2021

作者： Zhou, Yuying Harbin University of Commerce Harbin Heilongjiang150028 China

With the development of network technology and electronic information technology, the nonlinear programming problem (NPP) with inequality constraints in the BD framework has become one of the research hotspots and one of the trends that need improvement. Due to the introduction of BD technology, there is still a lack of research on the situation where the objective function is a NPP. The purpose of this article is to use the analysis and computing power of BD technology to simulate and calulate nonlinear programming (NP) with inequality constraints and improve it. In this paper, with the help of stability conditions, matrix splitting and iteration theory, the alternate direction method is used to solve the NPP with inequality constraints, and the principle of compressed mapping is used to finally prove the convergence of the alternate direction method. Matrix splitting techniques and Gauss-Seidel iterative ideas construct an iterative algorithm for solving linear systems. The iterative format of the alternating direction method for solving NPPs with inequality constraints and the equivalent matrix format are given to prepare for further proof of the convergence of the algorithm. Experimental research shows that the NPP model with inequality constraints designed by the dynamic BP technology error correction GPC algorithm used in this article has faster response time and smaller overshoot, and the control effect is better than 20% of the traditional GPC algorithm. © Published under licence by IOP Publishing Ltd.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Linear and nonlinear programming Approach for DC-link Current Optimization Applied to Interleaved Inverters

Linear and Nonlinear Programming Approach for DC-link Curren...

引用

ETG-Fachtagung Electromechanical Drive Systems 2021

作者： Fuller, Morris Griepentrog, Gerd König, Oliver TU Darmstadt Darmstadt Germany AVL List GmbH Graz Austria

ISBN: (纸本)9783800756872

This work proposes a DC-link current optimization for interleaved inverter systems using a linear and a nonlinear programming approach, respectively. The objective function aims at minimizing in RMS value of the AC-component of the DC-link current, i.e. the current mainly flowing through the DC-link capacitors. A case distinction is made between finite and infinite mutual interleaving *** performance benefits of the proposed method are shown by comparing the results of optimization to those of common modulation techniques, such as flat-top modulation and others. © VDE VERLAG GMBH ∙ Berlin ∙ Offenbach.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Sequential nonlinear programming Optimization for Circular Polarization in Jute Substrate-Based Monopole Antenna

Sequential Nonlinear Programming Optimization for Circular P...

引用

International Conference on Intelligent and Smart Computing in Data Analytics, ISCDA 2020

作者： Ram Sandeep, D. Prabakaran, N. Madhav, B.T.P. Vinay, D. Sri Hari, A. Jahnavi, L. Salma, S. Inturi, S. Department of ECE KLEF Guntur District Vaddeswaram AP522 502 India Lesia Observatorie de Paris CNRS Université PSL Sorbonne Université Université de Paris 5 place Jules Janssen Meudon92195 France

ISBN: (纸本)9789813361751

This paper presents the design optimization of a tri-band textile antenna, which is realized on jute material as the proper flexible substrate. First of all, the design process of the textile antenna is taken as a multi-dimensional problem with a primary objective of resonating with a return loss of greater than −25 dB in all operating frequencies. This design problem is converted as an optimization problem, where the sequential nonlinear programming (SNLP) algorithm of ANSYS HFSS is successfully used to optimize the geometric parameters of the textile antenna. Secondary, for validation of the optimized parameters, the tri-band antenna is fabricated on the jute material. Furthermore, the prototype antenna measurements are taken in the anechoic chamber and are compared with the simulation. Thus, based on the comparative study between the simulation and measurement, it is evident that the antenna was successfully operating in the tri-bands of Wi-MAX, WLAN, and ISM, with a return loss of more than −25. The SNLP algorithm works effectively to achieve the desired optimization. © 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Research on Bank Credit Strategy Decision Making Based on Neural Network and nonlinear programming 3

Research on Bank Credit Strategy Decision Making Based on Ne...

引用

3rd International Conference on Artificial Intelligence and Advanced Manufacture, AIAM 2021

作者： Qin, Yusong Yang, Jiaqi Chen, Shuai Li, Jingru Zunyi Normal University Beijing China Criminal Investigation Police University of China Beijing China School of Mechanical Engineering Nantong University Nantong China Nanning University Nanning China

ISBN: (纸本)9781450385046

In this paper, on the basis of the existing bank lending schemes, first quantitatively from the enterprise strength, corporate reputation and the stability of supply and demand of three selected 6 most representative credit measure, to quantify credit risk model based on XGBoost decision tree is calculated for each corporate lending after the probability of default, in order to measure the possibility of its repayment on time, The function relation between annual interest rate and customer churn rate is fitted by curve, so as to perfect the constraint conditions, establish the mechanism of nonlinear programming model, and get the optimal credit strategy decision scheme of the bank. Finally, DNN neural network model is used to predict and verify the data, analyze the law of credit strategy, conduct robustness analysis and verify the rationality of the results. Thus it solves the problems of quantification of risk and optimal credit strategy in bank credit of small and medium-sized enterprises. © 2021 ACM.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

A methodology for designing a nonlinear feedback controller via parametric optimization: State-parameterized nonlinear programming control 47

A methodology for designing a nonlinear feedback controller ...

引用

47th Design Automation Conference, DAC 2021, Held as Part of the ASME 2021 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference, IDETC-CIE 2021

作者： Tsai, Ying-Kuan Malak, Richard J. Design Systems Laboratory Department of Mechanical Engineering Texas A&M University College StationTX77843 United States

ISBN: (纸本)9780791885383

This paper introduces a new technique for designing nonlinear feedback controllers that can effectively and efficiently control nonlinear and unstable dynamical systems. The technique, called State-Parameterized nonlinear programming Control (sp-NLPC), constructs an optimal control strategy that is a function of dynamical system states. This is achieved through an offline parametric optimization process using the predictive parameterized Pareto genetic algorithm (P3GA) and representing the optimized state-varying policy using radial basis function (RBF) metamodeling. The sp-NLPC technique avoids many limitations of alternative methods, such as the need to make strong assumptions about model form (e.g., linearity) and the demands of online optimization processes. The proposed method is benchmarked on the problems of controlling the highly nonlinear and inherently unstable systems: single and double inverted pendulums on a cart. Performance and computational efficiency are compared to several competing control design techniques. Results show that sp-NLPC outperforms and is more efficient than competing methods. The parametric solution strategy for sp-NLPC lends itself to use in Control Co-Design (CCD). Such extensions are discussed as part of future work. Copyright © 2021 by ASME.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

Research on the Optimal Solution of Lagrangian Multiplier Function Method in nonlinear programming

Research on the Optimal Solution of Lagrangian Multiplier Fu...

引用

2021 Asia-Pacific Conference on Image Processing, Electronics and Computers, IPEC 2021

作者： Jin, Xue Nanjing University of Finance and Economics Hongshan College Jiangsu Zhenjiang212413 China

For the general nonlinear constrained optimization model, this article will propose a new nonlinear Lagrange function, discuss the properties of the function at the KKT point, and prove that under appropriate conditions, the iterative point generated by the dual algorithm based on the function The column is locally convergent, and then an error estimate of the solution related to the penalty parameter is given. This provides a new way to solve nonlinear constrained optimization problems. © Published under licence by IOP Publishing Ltd.

关键词： nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：