Results 31 to 40 of about 1,600 (140)
Estimating a Polya frequency function_2
, 2007 We consider the non-parametric maximum likelihood estimation in the class of Polya frequency functions of order two, viz. the densities with a concave logarithm. This is a subclass of unimodal densities and fairly rich in general.
Meyer, Mary +2 more
core +1 more source
, 2014 The main purpose of this paper is to introduce an iterative algorithm for equilibrium problems and split feasibility problems in Hilbert spaces. Under suitable conditions we prove that the sequence converges strongly to a common element of the set of ...
Jinfang Tang, Shih-sen Chang, Fei Yuan
semanticscholar +1 more source
Two Relaxed Inertial Forward–Reflected–Backward Splitting Algorithms With Momentum Terms
Journal of Mathematics, Volume 2025, Issue 1, 2025.In this paper, to solve the monotone inclusion problem consisting of the sum of two monotone operators in Hilbert spaces, we propose and study two modifications of Malitsky–Tam’s forward–reflection–backward splitting methods with double momentum terms. Meanwhile, we consider a relaxed inertial version to expand the range of allowable step sizes.
Binbin Zhang +3 more
wiley +1 more source
On ϵ-solutions for robust fractional optimization problems
, 2014 We consider ϵ-solutions (approximate solutions) for a fractional optimization problem in the face of data uncertainty. Using robust optimization approach (worst-case approach), we establish optimality theorems and duality theorems for ϵ-solutions for the
Jae Hyoung Lee, G. Lee
semanticscholar +1 more source
Principles of Extremum and Application to some Problems of Analysis [PDF]
, 1998 AMS subject classification: 41A17, 41A50, 49Kxx, 90C25.The aim of this paper is to demonstrate applications of a direct approach to the solution of extremal problems to some concrete problems of classical analysis, calculus of variations and ...
Tikhomirov, V.
core
, 2017 We present a subgradient method for minimizing non-smooth, non-Lipschitz convex optimization problems. The only structure assumed is that a strictly feasible point is known.
Grimmer, Benjamin
core +1 more source
Journal of Inequalities and Applications, 2014 In this paper, we give a unified computational scheme for the complexity analysis of kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone.
Xinzhong Cai +4 more
semanticscholar +1 more source
Extended Forward-Backward Algorithm
, 2013 We propose an extended forward-backward algorithm for approximating a zero of a maximal monotone operator which can be split as the extended sum of two maximal monotone operators.
Lassonde, Marc, Nagesseur, Ludovic
core +3 more sources
The robust isolated calmness of spectral norm regularized convex matrix optimization problems
Open MathematicsThis article aims to provide a series of characterizations of the robust isolated calmness of the Karush-Kuhn-Tucker (KKT) mapping for spectral norm regularized convex optimization problems. By establishing the variational properties of the spectral norm
Yin Ziran, Chen Xiaoyu, Zhang Jihong
doaj +1 more source
Well-Posedness, Conditioning and Regularization of Minimization, Inclusion and Fixed-Point Problems [PDF]
, 1998 AMS subject classification: 65K10, 49M07, 90C25, 90C48.Well-posedness, conditioning and regularization of fixed-point problems are studied in connexion with well-posedness, conditioning and Tikhonov regularization of minimization and inclusion problems ...
Lemaire, B.
core