Results 191 to 200 of about 330,664 (214)

A Localization Method for Multistatic SAR Based on Convex Optimization. [PDF]

open access: yesPLoS One, 2015
Zhong X   +5 more
europepmc   +1 more source

Solving Nonconvex Optimal Control Problems by Convex Optimization [PDF]

open access: possibleJournal of Guidance, Control, and Dynamics, 2013
Motivated by aerospace applications, this paper presents a methodology to use second-order cone programming to solve nonconvex optimal control problems. The nonconvexity arises from the presence of concave state inequality constraints and nonlinear terminal equality constraints.
Xinfu Liu, Ping Lu
openaire   +2 more sources

Convex Optimization With Convex Constraints

2001
In this chapter we want to solve the problem minf(x) | x ∈ C, where f is a convex function on ℝ n , and C is a convex, nonempty subset of ℝ n . A point x* ∈ C is a global solution, or more simply a solution to this problem, or a minimizer of f on C, if f(x*) ≤ f(x), ∀x ∈ C. We say that x* is a local solution to this problem if there exists a relatively
Cuong Le Van, Monique Florenzano
openaire   +2 more sources

Convexity and Optimization

2009
Optimization is a central theme of applied mathematics that involves minimizing or maximizing various quantities. This is an important application of the derivative tests in calculus. In addition to the first and second derivative tests of one-variable calculus, there is the powerful technique of Lagrange multipliers in several variables.
Kenneth R. Davidson, Allan P. Donsig
openaire   +2 more sources

Home - About - Disclaimer - Privacy