Displaying 181 – 200 of 4405

Showing per page

A new method of proof of Filippov’s theorem based on the viability theorem

Sławomir Plaskacz, Magdalena Wiśniewska (2012)

Open Mathematics

Filippov’s theorem implies that, given an absolutely continuous function y: [t 0; T] → ℝd and a set-valued map F(t, x) measurable in t and l(t)-Lipschitz in x, for any initial condition x 0, there exists a solution x(·) to the differential inclusion x′(t) ∈ F(t, x(t)) starting from x 0 at the time t 0 and satisfying the estimation x ( t ) - y ( t ) r ( t ) = x 0 - y ( t 0 ) e t 0 t l ( s ) d s + t 0 t γ ( s ) e s t l ( τ ) d τ d s , where the function γ(·) is the estimation of dist(y′(t), F(t, y(t))) ≤ γ(t). Setting P(t) = x ∈ ℝn: |x −y(t)| ≤ r(t), we may formulate the conclusion in Filippov’s theorem...

A new one-step smoothing newton method for second-order cone programming

Jingyong Tang, Guoping He, Li Dong, Liang Fang (2012)

Applications of Mathematics

In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be in the sets...

A new proof of the rectifiable slices theorem

Robert L. Jerrard (2002)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

This paper gives a new proof of the fact that a k -dimensional normal current T in m is integer multiplicity rectifiable if and only if for every projection P onto a k -dimensional subspace, almost every slice of T by P is 0 -dimensional integer multiplicity rectifiable, in other words, a sum of Dirac masses with integer weights. This is a special case of the Rectifiable Slices Theorem, which was first proved a few years ago by B. White.

A new regular multiplier embedding

Gemayqzel Bouza Allende, Jürgen Guddat (2013)

Kybernetika

Embedding approaches can be used for solving non linear programs P. The idea is to define a one-parametric problem such that for some value of the parameter the corresponding problem is equivalent to P. A particular case is the multipliers embedding, where the solutions of the corresponding parametric problem can be interpreted as the points computed by the multipliers method on P. However, in the known cases, either path-following methods can not be applied or the necessary conditions for its convergence...

A new series of conjectures and open questions in optimization and matrix analysis

Jean-Baptiste Hiriart-Urruty (2009)

ESAIM: Control, Optimisation and Calculus of Variations

We present below a new series of conjectures and open problems in the fields of (global) Optimization and Matrix analysis, in the same spirit as our recently published paper [J.-B. Hiriart-Urruty, Potpourri of conjectures and open questions in Nonlinear analysis and Optimization. SIAM Review 49 (2007) 255–273]. With each problem come a succinct presentation, a list of specific references, and a view on the state of the art of the subject.

A new series of conjectures and open questions in optimization and matrix analysis

Jean-Baptiste Hiriart-Urruty (2008)

ESAIM: Control, Optimisation and Calculus of Variations

We present below a new series of conjectures and open problems in the fields of (global) Optimization and Matrix analysis, in the same spirit as our recently published paper [J.-B. Hiriart-Urruty, Potpourri of conjectures and open questions in Nonlinear analysis and Optimization. SIAM Review49 (2007) 255–273]. With each problem come a succinct presentation, a list of specific references, and a view on the state of the art of the subject.

Currently displaying 181 – 200 of 4405