Results 31 to 40 of about 1,554 (121)
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
Every maximally monotone operator of Fitzpatrick-Phelps type is actually of dense type
, 2011 We show that every maximally monotone operator of Fitzpatrick-Phelps type defined on a real Banach space must be of dense type. This provides an affirmative answer to a question posed by Stephen Simons in 2001 and implies that various important notions ...
Bauschke, Heinz H. +3 more
core +2 more sources
Alternating minimization method for total variation based wavelet shrinkage model
, 2010 In this paper, we introduce a novel hybrid variational model which gen- eralizes the classical total variation method and the wavelet shrinkage method. An alternating minimization direction algorithm is then employed.
T. Zeng, Xiaolong Li, M. Ng
semanticscholar +1 more source
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
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
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
The contraction-proximal point algorithm with square-summable errors
, 2013 In this paper, we study the contraction-proximal point algorithm for approximating a zero of a maximal monotone mapping. The norm convergence of such an algorithm has been established under two new conditions.
C. Tian, Fenghui Wang
semanticscholar +1 more source
Iterative algorithms for minimum-norm fixed point of non-expansive mapping in hilbert space
, 2012 The purpose of this article is to introduce two iterative algorithms for finding the least norm fixed point of nonexpansive mappings. We provide two algorithms, one implicit and another explicit, from which strong convergence theorems are obtained in ...
Yong Cai, Yuchao Tang, Li-Wei Liu
semanticscholar +1 more source
, 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