Displaying similar documents to “A moment problem for discrete nonpositive measures on a finite interval.”

Optimization problems with convex epigraphs. Application to optimal control

Arkadii Kryazhimskii (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

For a class of infinite-dimensional minimization problems with nonlinear equality constraints, an iterative algorithm for finding global solutions is suggested. A key assumption is the convexity of the ''epigraph'', a set in the product of the image spaces of the constraint and objective functions. A convexification method involving randomization is used. The algorithm is based on the extremal shift control principle due to N.N. Krasovskii. An application to a problem of optimal control...

A globally convergent non-interior point algorithm with full Newton step for second-order cone programming

Liang Fang, Guoping He, Li Sun (2009)

Applications of Mathematics

Similarity:

A non-interior point algorithm based on projection for second-order cone programming problems is proposed and analyzed. The main idea of the algorithm is that we cast the complementary equation in the primal-dual optimality conditions as a projection equation. By using this reformulation, we only need to solve a system of linear equations with the same coefficient matrix and compute two simple projections at each iteration, without performing any line search. This algorithm can start...