Related papers: Universality for non-linear convex variational pro…
This paper is a follow up to the previous author's paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation for finding sparse solutions of convex optimization…
In a recent paper~\cite{paper2}, we proposed the concept of optimal error bounds for an iterative process, which allows us to obtain the convergence result of the iterative sequence to the common fixed point of the nonexpansive mappings in…
Strong convergence of a new iterative process based on the Shrinking projection method to a common element of the set of common fixed points of an infinite family of relatively quasi-nonexpansive multivalued mappings and the solution set of…
This paper presents a new approach to studying nonlinear resolvents of holomorphically accretive mappings on the open unit ball of a complex Banach space. We establish a distortion theorem and apply it to address problems in geometric…
We propose a stochastic variance reduced optimization algorithm for solving sparse learning problems with cardinality constraints. Sufficient conditions are provided, under which the proposed algorithm enjoys strong linear convergence…
This work introduces a sampling method capable of solving Bayesian inverse problems in function space. It does not assume the log-concavity of the likelihood, meaning that it is compatible with nonlinear inverse problems. The method…
The $m$-point nonlocal problem for the first order differential equation with an operator coefficient in a Banach space $X$ is considered. An exponentially convergent algorithm is proposed and justified provided that the operator…
This paper presents a convex optimization-based method for finding the globally optimal solutions of a class of mixed-integer non-convex optimal control problems. We consider problems that are non-convex in the input norm, which is a…
This paper presents a general description of a parameter estimation inverse problem for systems governed by nonlinear differential equations. The inverse problem is presented using optimal control tools with state constraints, where the…
In this paper we survey known results of characterizations of reflexive Banach spaces, which are based on convergence of usual and generalized arithmetic mean (or Ces\`aro sum), weakly compact subsets, affine sets in a Banach space or its…
The paper concerns foundations of sensitivity and stability analysis in optimization and related areas, being primarily addressed truncated constrained systems. We consider general models, which are described by multifunctions between…
In this paper, using sunny generalized nonexpansive retraction, we propose new extragradient and linesearch algorithms for finding a common element of the set of solutions of an equilibrium problem and the set of fixed points of a…
A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two dimensional image of a shape approximately. The use of a rectangle blanket is a widely considered strategy for speeding-up the…
It is well known that in the calculus of variations and in optimization there exist many formulations of the fundamental propositions on the attainment of the infima of sequentially weakly lower semicontinuous coercive functions on…
Banach's fixed point theorem for contraction maps has been widely used to analyze the convergence of iterative methods in non-convex problems. It is a common experience, however, that iterative maps fail to be globally contracting under the…
Constrained non-convex optimization problems frequently arise in control applications. Solving such problems is inherently challenging, as existing methods often converge to suboptimal local minima or incur prohibitive computational costs.…
This paper presents a pure complementary energy variational method for solving anti-plane shear problem in finite elasticity. Based on the canonical duality-triality theory developed by the author, the nonlinear/nonconex partial…
We investigate the stochastic optimization problem of minimizing population risk, where the loss defining the risk is assumed to be weakly convex. Compositions of Lipschitz convex functions with smooth maps are the primary examples of such…
Errors in the data and the forward operator of an inverse problem can be handily modelled using partial order in Banach lattices. We present some existing results of the theory of regularisation in this novel framework, where errors are…
In this paper we present a general convex optimization approach for solving high-dimensional multiple response tensor regression problems under low-dimensional structural assumptions. We consider using convex and weakly decomposable…