Results 51 to 60 of about 1,554 (121)
New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
A linear optimization problem over a symmetric cone, defined in a Euclidean Jordan algebra and called a self-scaled optimization problem (SOP), is considered.
Bo Kyung Choi, G. Lee
semanticscholar +1 more source
We analyze the proximal alternating linearized minimization algorithm (PALM) for solving non-smooth convex minimization problems where the objective function is a sum of a smooth convex function and block separable non-smooth extended real-valued convex ...
Ron Shefi, Marc Teboulle
doaj
A damped algorithm for the split feasibility and fixed point problems
The purpose of this paper is to study the split feasibility problem and the fixed point problem. We suggest a damped algorithm. Convergence theorem is proven.MSC:47J25, 47H09, 65J15, 90C25.
Cun-lin Li, Y. Liou, Yonghong Yao
semanticscholar +1 more source
Monotone Linear Relations: Maximality and Fitzpatrick Functions [PDF]
We analyze and characterize maximal monotonicity of linear relations (set-valued operators with linear graphs). An important tool in our study are Fitzpatrick functions.
Bauschke, Heinz H.+2 more
core +1 more source
In this paper, we introduce an iterative scheme for finding a common element of the sets of fixed points for multivalued nonexpansive mappings, strict pseudo-contractive mappings and the set of solutions of an equilibrium problem for a pseudomonotone ...
J. Vahidi, A. Latif, M. Eslamian
semanticscholar +1 more source
A projective splitting algorithm for solving generalized mixed variational inequalities
In this paper, a projective splitting method for solving a class of generalized mixed variational inequalities is considered in Hilbert spaces. We investigate a general iterative algorithm, which consists of a splitting proximal point step followed by a ...
Zou Yun-zhi, Xia Fu-quan
doaj
A Positivstellensatz which Preserves the Coupling Pattern of Variables
We specialize Schm\"udgen's Positivstellensatz and its Putinar and Jacobi and Prestel refinement, to the case of a polynomial $f\in R[X,Y]+R[Y,Z]$, positive on a compact basic semi algebraic set $K$ described by polynomials in $R[X,Y]$ and $R[Y,Z]$ only,
Lasserre, Jean B.
core +2 more sources
Uncontrolled inexact information within bundle methods
We consider convex non-smooth optimization problems where additional information with uncontrolled accuracy is readily available. It is often the case when the objective function is itself the output of an optimization solver, as for large-scale energy ...
Jérôme Malick+2 more
doaj
A fast continuous time approach with time scaling for nonsmooth convex optimization. [PDF]
Boţ RI, Karapetyants MA.
europepmc +1 more source
Optimal transport of vector measures. [PDF]
Ciosmak KJ.
europepmc +1 more source