Subgradient Optimization (or Subgradient Method) is an iterative algorithm
for minimizing convex functions, used predominantly in Nondifferentiable
optimization for functions that are convex but nondifferentiable. It is often slower
than Newton's Method when applied to convex differentiable functions, but can
be used on convex nondifferentiable functions where Newton's Method will...
Optimization with absolute values is a special case of linear programming in which a problem made nonlinear due
to the presence of absolute values is solved using linear programming methods.
Absolute value functions themselves are very difficult to perform standard optimization procedures on. They are
not continuously differentiable functions, are...
This article concerns the exponential transformation method for globally solving posynomial (or general
geometric/signomial) optimization problems with nonconvex objective functions or constraints. A discussion of the
method's development and use will be presented.
Optimization and Game Theory have certain conceptual overlaps. It is even said that John von Neumann
conjectured the Duality Theorem using information from his game theory. This article discusses two optimization
applications to the game theory: a methodology for solving the Nash Equilibrium and a decentralized model in
supply chain...
Aerospace collectively represents one of the most sophisticated technological endeavors and largest markets in the
world. Coming with substantial costs, nearly every aspect of the industry, from aircraft design to material selection
to operation, has been optimized in at least one way. A critical design consideration in any aircraft is...
With aggressive scaling down of feature sizes in VLSI fabrication, process variations, crosstalk and buffering have become critical issues to achieve timing closure in VLSI designs. Timing analysis and optimization techniques need to consider each of them and also their interactions. There are many statistical timing analysis researches to handle...
The behavior of type-II superconductors is modeled using the time-dependent Ginzburg Landau equations (TDGLE). Pinning centers (inclusions) and geometries which maximize the critical current that can be passed through a superconductor are numerically obtained. Previous analytical results are summarized and new results are obtained for the critical current in one...