標(biāo)題: Titlebook: Global Optimization and Constraint Satisfaction; First International Christian Bliek,Christophe Jermann,Arnold Neumaier Conference proceed [打印本頁(yè)] 作者: Autopsy 時(shí)間: 2025-3-21 19:05
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction影響因子(影響力)
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction被引頻次
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction被引頻次學(xué)科排名
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction年度引用
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction年度引用學(xué)科排名
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction讀者反饋
書(shū)目名稱(chēng)Global Optimization and Constraint Satisfaction讀者反饋學(xué)科排名
作者: reptile 時(shí)間: 2025-3-22 00:09
Christian Bliek,Christophe Jermann,Arnold Neumaier作者: 感染 時(shí)間: 2025-3-22 02:22 作者: 歡騰 時(shí)間: 2025-3-22 07:40 作者: TIA742 時(shí)間: 2025-3-22 10:44 作者: 奇思怪想 時(shí)間: 2025-3-22 15:12 作者: 奇思怪想 時(shí)間: 2025-3-22 20:19
Record Keeping and Presentation systems, there are more interval equations than unknowns. As a result, these systems can appear to be inconsistent when they are not. An algorithm is given to compute interval nonlinear parameter bounds from fallible data and to possibly prove that no bounds exist because the tall system is inconsistent.作者: RADE 時(shí)間: 2025-3-22 23:54
LaGO – An Object Oriented Library for Solving MINLPsnvex relaxation which is used for generating solution candidates and computing lower bounds of the optimal value. The relaxation is generated by reformulating the given MINLP as a block-separable problem, and replacing nonconvex functions by convex underestimators. Results on medium size MINLPs are presented... 90C22, 90C20, 90C27, 90C26, 90C59作者: 錯(cuò)事 時(shí)間: 2025-3-23 05:06 作者: Visual-Acuity 時(shí)間: 2025-3-23 05:53 作者: reserve 時(shí)間: 2025-3-23 11:26
Global Optimization and Constraint Satisfaction978-3-540-39901-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: peritonitis 時(shí)間: 2025-3-23 17:41 作者: FEAS 時(shí)間: 2025-3-23 19:08
GlobSol: History, Composition, and Advice on Usesolutions to unconstrained and constrained global optimization problems. After briefly reviewing some of these techniques and GlobSol’s development history, we provide the first overall description of GlobSol’s algorithm. Giving advice on use, we point out strengths and weaknesses in GlobSol’s appro作者: thrombus 時(shí)間: 2025-3-24 02:13 作者: 爭(zhēng)吵加 時(shí)間: 2025-3-24 04:22 作者: 頂點(diǎn) 時(shí)間: 2025-3-24 08:10
Minimal and Maximal Real Roots of Parametric Polynomials Using Interval Analysised to lie within given ranges. We propose algorithms based on interval analysis to solve various problems such as finding the extremal real roots for the set of polynomials and determining an approximation of the set of parameters values such that all the polynomials have their root real part in a g作者: AGATE 時(shí)間: 2025-3-24 11:26
D.C. Programming for Solving a Class of Global Optimization Problems via Reformulation by Exact Penareverse convex constraint. Using a related exact penalty property, we reformulate the class of mixed zero-one concave minimization programs, concave minimization programs over efficient sets, bilevel programs, and concave minimization programs with mixed linear complementarity constraints in the for作者: Inferior 時(shí)間: 2025-3-24 17:53 作者: 宣誓書(shū) 時(shí)間: 2025-3-24 20:04
A Global Constrained Optimization Algorithm for Engine Calibrationa great number of linear and non linear constraints and containing a large number of local minima. Therefore, we use a strategy combining global and local optimization. We propose a new global stochastic optimization algorithm called Multistoch generating a fixed number of starting points for a loca作者: ANT 時(shí)間: 2025-3-25 01:08
Numerical Behavior of a Stabilized SQP Method for Degenerate NLP Problemsnonlinear programming problems at which strict complementarity and/or linear independence of the gradients of the active constraints may fail to hold at the solution. We have collected a number of degenerate problems from different sources. Our numerical experiments have shown that the sSQPa is effi作者: NADIR 時(shí)間: 2025-3-25 04:06 作者: 全部 時(shí)間: 2025-3-25 07:39
Consistency Techniques for the Localization of a Satelliteem over continuous domains with a large number (several thousands) of variables and constraints. Consistency techniques are then shown to be particularly efficient to contract the domains for the variables involved. This is probably due to the large number of redundancies naturally involved in the c作者: homeostasis 時(shí)間: 2025-3-25 14:54
Computing Interval Parameter Bounds from Fallible Measurements Using Overdetermined (Tall) Systems o systems, there are more interval equations than unknowns. As a result, these systems can appear to be inconsistent when they are not. An algorithm is given to compute interval nonlinear parameter bounds from fallible data and to possibly prove that no bounds exist because the tall system is inconsi作者: overwrought 時(shí)間: 2025-3-25 18:17 作者: 不開(kāi)心 時(shí)間: 2025-3-25 21:49
Numerical Constraint Satisfaction Problems with Non-isolated Solutionser, most of the working systems are designed to deliver . solutions with an arbitrary accuracy. This works generally well for systems with isolated solutions but less well when there is a . (e.g. under-constrained problems, problems with inequalities). In many practical applications, such large sets作者: 描繪 時(shí)間: 2025-3-26 02:28 作者: 考得 時(shí)間: 2025-3-26 06:04 作者: 問(wèn)到了燒瓶 時(shí)間: 2025-3-26 11:02
Jennie P. Mather,Penelope E. Robertssolutions to unconstrained and constrained global optimization problems. After briefly reviewing some of these techniques and GlobSol’s development history, we provide the first overall description of GlobSol’s algorithm. Giving advice on use, we point out strengths and weaknesses in GlobSol’s appro作者: Aids209 時(shí)間: 2025-3-26 13:20
Takashi Kurahashi,Geoffrey H. Goldnvex relaxation which is used for generating solution candidates and computing lower bounds of the optimal value. The relaxation is generated by reformulating the given MINLP as a block-separable problem, and replacing nonconvex functions by convex underestimators. Results on medium size MINLPs are 作者: membrane 時(shí)間: 2025-3-26 18:18 作者: Affirm 時(shí)間: 2025-3-26 22:38 作者: Pamphlet 時(shí)間: 2025-3-27 01:31
Ana Irene Ramírez Galarza,José Seadereverse convex constraint. Using a related exact penalty property, we reformulate the class of mixed zero-one concave minimization programs, concave minimization programs over efficient sets, bilevel programs, and concave minimization programs with mixed linear complementarity constraints in the for作者: Etymology 時(shí)間: 2025-3-27 08:44 作者: 騷擾 時(shí)間: 2025-3-27 12:49
https://doi.org/10.1007/978-94-011-2368-6a great number of linear and non linear constraints and containing a large number of local minima. Therefore, we use a strategy combining global and local optimization. We propose a new global stochastic optimization algorithm called Multistoch generating a fixed number of starting points for a loca作者: Irremediable 時(shí)間: 2025-3-27 15:05
https://doi.org/10.1007/978-3-031-30804-8nonlinear programming problems at which strict complementarity and/or linear independence of the gradients of the active constraints may fail to hold at the solution. We have collected a number of degenerate problems from different sources. Our numerical experiments have shown that the sSQPa is effi作者: 盤(pán)旋 時(shí)間: 2025-3-27 18:02 作者: 臆斷 時(shí)間: 2025-3-28 00:04
Robert L. Hale,Elizabeth A. Greenem over continuous domains with a large number (several thousands) of variables and constraints. Consistency techniques are then shown to be particularly efficient to contract the domains for the variables involved. This is probably due to the large number of redundancies naturally involved in the c作者: 消瘦 時(shí)間: 2025-3-28 05:15 作者: 六個(gè)才偏離 時(shí)間: 2025-3-28 09:10
Introduction to Coastline Developmente definition of the solution space and the computational efforts required. In alternative to local consistency, we propose maintaining global hull-consistency and present experimental results that show that this may be an appropriate alternative to other higher order consistencies. We tested various作者: 睨視 時(shí)間: 2025-3-28 12:06
Introduction to Combinatorial Torsionser, most of the working systems are designed to deliver . solutions with an arbitrary accuracy. This works generally well for systems with isolated solutions but less well when there is a . (e.g. under-constrained problems, problems with inequalities). In many practical applications, such large sets作者: 沒(méi)有貧窮 時(shí)間: 2025-3-28 15:27 作者: opinionated 時(shí)間: 2025-3-28 22:19
Introduction to Combinatorial Torsionspolyhedra 1,2,3, as defined in computational geometry, with adapted . 4 to construct the approximations as unions of interval boxes. This allows for compacting the explicit representation of the complete solution set and improves efficiency.作者: 政府 時(shí)間: 2025-3-29 02:01 作者: 愛(ài)花花兒憤怒 時(shí)間: 2025-3-29 05:26
Numerical Constraint Satisfaction Problems with Non-isolated Solutionspolyhedra 1,2,3, as defined in computational geometry, with adapted . 4 to construct the approximations as unions of interval boxes. This allows for compacting the explicit representation of the complete solution set and improves efficiency.作者: 背叛者 時(shí)間: 2025-3-29 09:47 作者: 合同 時(shí)間: 2025-3-29 14:54 作者: 衰弱的心 時(shí)間: 2025-3-29 18:49
https://doi.org/10.1007/978-1-4614-6283-5pplemented with a variety of branching and bounding schemes. In this paper, we review the theory and algorithms behind branch-and-reduce, its implementation in the BARON software, and some recent successful applications.作者: 取之不竭 時(shí)間: 2025-3-29 21:33 作者: Insubordinate 時(shí)間: 2025-3-30 00:51
Complex Arithmetic and Algebra,the set of polynomials and determining an approximation of the set of parameters values such that all the polynomials have their root real part in a given range. Realistic application examples are presented in the field of robotics and control theory.作者: blackout 時(shí)間: 2025-3-30 05:18 作者: Myelin 時(shí)間: 2025-3-30 11:26
Introduction to Classical Mathematics Ierized by their ability to detect and eliminate sub-optimal feasible regions. This ability is increased by availability of a good upper bound on the global minimum. In this paper, we present a symbolic-interval algorithm for calculation of upper bounds in bound-constrained global minimization problems and report the results of some experiments.作者: Madrigal 時(shí)間: 2025-3-30 14:07
Prateek D. Wali,Manika Suryadevaraproblems. We describe the implemented solver and its integration into the scheduling system. We include discussion of pragmatic design tradeoffs critically important to achieving reasonable performance.作者: commute 時(shí)間: 2025-3-30 18:07 作者: CUMB 時(shí)間: 2025-3-30 22:48 作者: 休閑 時(shí)間: 2025-3-31 02:55 作者: 古代 時(shí)間: 2025-3-31 05:24 作者: Obituary 時(shí)間: 2025-3-31 10:29
Guobin Xu,Yanhui Chen,Lianhua Xu In this paper we first briefly describe the theoretical background underlying the relaxations. Following a small illustrative example of the use of GloptiPoly, we then evaluate its performance on benchmark test examples from global optimization, combinatorial optimization and polynomial systems of equations.作者: tic-douloureux 時(shí)間: 2025-3-31 13:30 作者: lattice 時(shí)間: 2025-3-31 20:41 作者: graphy 時(shí)間: 2025-4-1 00:51
