Related papers: Projection onto simplicial cones by a semi-smooth …
A semi-local analysis of Newton's method for solving nonlinear inclusion problems in Banach space is presented in this paper. Under a affine majorant condition on the nonlinear function which is associated to the inclusion problem, the…
We study the orthogonal projections of symplectic balls in $\mathbb{R}^{2n}$ on complex subspaces. In particular we show that these projections are themselves symplectic balls under a certain complexity assumption. Our main result is a…
In this paper, we propose a globally convergent method for solving constrained nonlinear systems. The method combines an efficient Newton conditional gradient method with a derivative-free and nonmonotone linesearch strategy. The global…
The Newton iteration is a popular method for minimising a cost function on Euclidean space. Various generalisations to cost functions defined on manifolds appear in the literature. In each case, the convergence rate of the generalised…
In this paper, we propose two regularized proximal quasi-Newton methods with symmetric rank-1 update of the metric (SR1 quasi-Newton) to solve non-smooth convex additive composite problems. Both algorithms avoid using line search or other…
We consider the standard optimistic bilevel optimization problem, in particular upper- and lower-level constraints can be coupled. By means of the lower-level value function, the problem is transformed into a single-level optimization…
A projection operator technique for solution of relativistic wave equation on non-compact group has been proposed. This technique was applied to the construction of wave equations for charged vector boson in a potential field. The equations…
Two new optimization techniques based on projections onto convex space (POCS) framework for solving convex optimization problems are presented. The dimension of the minimization problem is lifted by one and sets corresponding to the cost…
In this paper, we study the linear complementarity problems on the monotone extended second order cones. We demonstrate that the linear complementarity problem on the monotone extended second order cone can be converted into a mixed…
We provide two methods for constructing smooth bump functions and for smoothly cutting off smooth functions on fractals, one using a probabilistic approach and sub-Gaussian estimates for the heat operator, and the other using the analytic…
We introduce a new framework for analyzing (Quasi-}Newton type methods applied to non-smooth optimization problems. The source of randomness comes from the evaluation of the (approximation) of the Hessian. We derive, using a variant of…
We propose a generalization of SHGH Conjectures to a smooth projective surface Y: the so called Segre Problem. The study of linear systems on Y can be translated in terms of the Mori cone of the blow up $X = Bl_r Y$ at $r$ general points.…
The classical theory of plane projective geometry is examined constructively, using both synthetic and analytic methods. The topics include Desargues's Theorem, harmonic conjugates, projectivities, involutions, conics, Pascal's Theorem,…
We introduce and study the convergence properties of a projection-type algorithm for solving the variational inequality problem for point-to-set operators. No monotoni\-city assumption is used in our analysis. The operator defining the…
Fixed-point or Newton-methods are typically employed for the numerical solution of nonlinear systems arising from discretization of nonlinear magnetic field problems. We here discuss an alternative strategy which uses local Quasi-Newton…
We investigate a globalized inexact semismooth Newton method applied to strongly convex optimization problems in Hilbert spaces. Here, the semismooth Newton method is appplied to the dual problem, which has a continuously differentiable…
In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…
This is the second of two papers, in which we prove a version of Conn's linearization theorem for the Lie algebra $\mathfrak{sl}_2(\mathbb{C})\simeq \mathfrak{so}(3,1)$. Namely, we show that any Poisson structure whose linear approximation…
We first investigate properties of M-tensor equations. In particular, we show that if the constant term of the equation is nonnegative, then finding a nonnegative solution of the equation can be done by finding a positive solution of a…
This paper proposes a nonmonotone proximal quasi-Newton algorithm for unconstrained convex multiobjective composite optimization problems. To design the search direction, we minimize the max-scalarization of the variations of the Hessian…