Patent
Flexible vector-processing algorithms for numerically solving extreme-scale, linear and non-linear, predictive and prescriptive, problems in science and engineering, on parallel-processing super computers
Elmor L. Peterson
- 31 Mar 2015
3
TL;DR: In this paper, a computer-implemented method for numerical solution of a geometric programming problem is described, including the computer-simplemented steps of: reformulating the geometric program problem as an equivalent generalized geometric programming optimization problem with only linear constraints, and solving the equivalent generalization problem by vector processing.
read more
Abstract: A computer-implemented method for numerical solution of a geometric programming problem is described, including the computer-implemented steps of: reformulating the geometric programming problem as an equivalent generalized geometric programming optimization problem with only linear constraints, and solving the equivalent generalized geometric programming optimization problem by vector processing, including determining by computer-implemented numerical computation a solution for an unconstrained objective function whose independent vector variable is the generalized geometric programming conjugate dual of a primal decision vector variable of the geometric programming problem, and includes a variable linear combination of fixed vectors enabling the vector processing. Also described are computer-readable storage devices, computer program products, and computer systems for such numerical solution methodology.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Patent
Information processing architecture for network edge-based optimization problems
Stringfellow Stanley George
- 20 Sep 2018
TL;DR: In this article, the authors propose an information processing architecture for network edge-based systems which solve optimization problems by using sub-problem solvers for decomposed mathematical programs, which operate on network edge nodes; and reduced master problem solvers (RM solvers) for decomposing mathematical programs.
6
Patent
Smart grid controller
Shear Dan
- 06 Apr 2021
TL;DR: In this paper, the authors provide a method for determining a plurality of constraints for a system in a first format, and then converting the plurality constraints in the first format into a set of formatted constraints in a second format; determining an optimal solution by performing an optimization technique on the near-feasible solution based on the first subset of the formatted constraints.
Patent
Method for sensory evaluation of penthorum chinense pursh tea based on fuzzy mathematical method
Duan Feixia,Zhang Zihan,Wang Xingyue +2 more
- 08 Jan 2021
TL;DR: In this paper, a method for sensory evaluation of penthorum chinense pursh pursh tea based on a fuzzy mathematical method is proposed. But the method is not suitable for the evaluation of traditional Chinese medicine products.
References
Patent
Method and system for diagnostics of apparatus
Dimitry Gorinevsky
- 10 Nov 2008
TL;DR: In this paper, a convex optimization problem for each fault hypothesis is formulated and the highest likelihoods and corresponding parameter estimates are transmitted to a display device or an automated decision and control system.
79
Patent
Dynamical methods for solving large-scale discrete and continuous optimization problems
Hsiao-Dong Chiang,Hua Li +1 more
- 22 May 2002
TL;DR: In this article, the global optimal solution of general optimization problems having closed form or black-box objective functions is obtained by finding a local optimal solution starting from an initial point, and then finding another local optimizer starting from the previously found one until all the local optimizers starting from any initial point are found.
47
A New Self-Dual Embedding Method for Convex Programming
TL;DR: This paper proposes a self-dual embedding model for solving constrained convex programming, and proves that the barrier functions constructed this way are indeed self-concordant when the original constraint functions are convex and quadratic.
30
Patent
Method and apparatus for automatic analog/mixed signal system design using geometric programming
Arash Hassibi,Maria Del Mar Hershenson,David M. Colleran +2 more
- 07 Apr 2002
TL;DR: In this article, a method is described that involves recognizing that a variable within a monomial or posynomial expression for a characteristic of an analog or mixed signal system has a dependency on a lower level expression.
30
Patent
Method and system for optimization of general problems
Wolf Kohn,Vladimir Brayman +1 more
- 15 Mar 2006
TL;DR: In this article, a global objective function is transformed into a system of differential equations in terms of continuous variables and parameters, so that polynomial-time methods for solving differential equations can be applied to calculate near-optimal solutions for the global objective functions.
24