Results 31 to 40 of about 5,976,148 (331)

Clustering with Semidefinite Programming and Fixed Point Iteration

open access: yesJ. Mach. Learn. Res., 2020
We introduce a novel method for clustering using a semidefinite programming (SDP) relaxation of the Max k-Cut problem. The approach is based on a new methodology for rounding the solution of an SDP relaxation using iterated linear optimization. We show the vertices of the Max k-Cut relaxation correspond to partitions of the data into at most k sets. We
Pedro F. Felzenszwalb   +2 more
openaire   +4 more sources

Convergence Rate of Some Two-Step Iterative Schemes in Banach Spaces

open access: yesJournal of Mathematics, 2016
This article proves some theorems to approximate fixed point of Zamfirescu operators on normed spaces for some two-step iterative schemes, namely, Picard-Mann iteration, Ishikawa iteration, S-iteration, and Thianwan iteration, with their errors.
O. T. Wahab   +3 more
doaj   +1 more source

On the Rate of Convergence of P-Iteration, SP-Iteration, and D-Iteration Methods for Continuous Nondecreasing Functions on Closed Intervals

open access: yesAbstract and Applied Analysis, 2018
We introduce a new iterative method called D-iteration to approximate a fixed point of continuous nondecreasing functions on arbitrary closed intervals. The purpose is to improve the rate of convergence compared to previous work.
Jukkrit Daengsaen, Anchalee Khemphet
doaj   +1 more source

Adjoints Of Fixed-Point Iterations

open access: yes, 2014
Adjoint algorithms, and in particular those obtained through the adjoint mode of Automatic Differentiation (AD), are probably the most efficient way to obtain the gradient of a numerical simulation. This however needs to use the ow of data of the original simulation in reverse order, at a cost that increases with the length of the simulation.
Taftaf, Ala   +2 more
openaire   +3 more sources

Revisiting the MIMO Capacity With Per-Antenna Power Constraint: Fixed-Point Iteration and Alternating Optimization

open access: yesIEEE Transactions on Wireless Communications, 2019
In this paper, we revisit the fundamental problem of computing MIMO capacity under per-antenna power constraint (PAPC). Unlike the sum power constraint counterpart which likely admits water-filling-like solutions, MIMO capacity with PAPC has been largely
Thuy M. Pham, R. Farrell, Le-Nam Tran
semanticscholar   +1 more source

A generalization of some fixed point theorems of K. M. Ghosh

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1982
This note establishes the following result. Let T be a selfmap of a normed linear space E.
B. E. Rhoades
doaj   +1 more source

A polynomially accelerated fixed-point iteration for vector problems [PDF]

open access: yesE-Journal of Analysis and Applied Mathematics
Fixed-point solvers are ubiquitous in nonlinear PDEs, yet their progress collapses whenever the Jacobian at the solution carries an eigenvalue arbitrarily close to one.
Francesco Alemanno
doaj   +1 more source

Hölder-type spaces, singular operators, and fixed point theorems

open access: yes, 2021
In this note, we give a sufficient condition for the existence of Hölder-type solutions to a class of fractional initial value problems involving Caputo derivatives.
López Brito, María Belén   +4 more
core   +1 more source

A generalization of contraction principle

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1981
In this paper, a generalized mean value contraction is introduced. This contraction is an extension of the contractions of earlier researchers and of the generalized mean value non-expansive mapping.
K. M. Ghosh
doaj   +1 more source

The Fixed Point Property of Strong Pseudocontraction Mapping

open access: yesJournal of Harbin University of Science and Technology, 2020
In this paper, the iterative methods of fixed point of strong pseudocontraction mappings and accretive operators are studied in Banach spaces. A new threestep Ishikawa iteration is given.
CUI Yunan, ZHU Peng, WANG Ping
doaj   +1 more source

Home - About - Disclaimer - Privacy