minimization problem
Multiple Square Root Minimization Problem
... Multiple-Square-Root Minimization problem are presented by Shen et al ...covering problem and applied a column generation algorithm to solve ...of problem in [7] through a corres- ponding ...
17
Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator
... convex minimization problem and the set of zero points of the maximal monotone operator ...operator problem can be transformed into the equilibrium ...feasibility problem and the constrained ...
23
Iterative methods for constrained convex minimization problem in Hilbert spaces
... In this paper, based on Yamada’s hybrid steepest descent method, a general iterative method is proposed for solving constrained convex minimization problem. It is proved that the sequences generated by ...
18
Iterative algorithm of common solutions for a constrained convex minimization problem, a quasi-variational inclusion problem and the fixed point problem of a strictly pseudo-contractive mapping
... Theorem . Let C be a nonempty closed convex subset of a real Hilbert space H . For the minimization problem (.), assume that f is (Frechet) differentiable and the gradient ∇ f is a ρ-inverse-strongly ...
15
An Iterative Algorithm of Solution for Quadratic Minimization Problem in Hilbert Spaces
... quadratic minimization problem in the set of fixed points of a nonexpansive mapping and to prove a strong convergence theorem of the solution for quadratic minimization ...
6
General iterative scheme based on the regularization for solving a constrained convex minimization problem
... It is well known that the regularization method plays an important role in solving a constrained convex minimization problem. In this article, we introduce implicit and explicit iterative schemes based on ...
15
Regularized gradient projection methods for finding the minimum norm solution of the constrained convex minimization problem
... convex minimization problem, where < λ < L+ ...feasibility problem and use a concrete example and numerical results to illustrate that our algorithm has fast ...
12
An intermixed iteration for constrained convex minimization problem and split feasibility problem
... The purpose of this article is to combine the GPA and averaged mapping approach to design a two-step intermixed iteration for finding the common solution of a constrained convex minimization problem, and ...
22
Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
... equilibrium problem and the constrained convex minimization problem have extensively been studied respectively in a Hilbert ...equilibrium problem and the set of solutions of a constrained ...
17
Local Search Heuristics for NFA State Minimization Problem
... In the present paper we have considered new heuristic algorithms for NFA state minimization problem which is known to be computationally hard. These algorithms are a combination of the classical ...
6
An iterative algorithm for fixed point problem and convex minimization problem with applications
... convex minimization problem for a convex and continuously Fréchet differen- tiable functional in a real Hilbert space and prove strong convergence of the sequences generated by our scheme in a real Hilbert ...
17
Neural Network Performance for Complex Minimization Problem
... The comparison of ANN and MINUIT methods of shower reconstruction given in the Table 1 shows that the Neural Networks can perform the competitive solutions of the complex minimization problem under study. ...
7
Extragradient method for convex minimization problem
... point problem of a strictly pseudocontractive ...inequality problem (over the fixed point set of a strictly pseudocontractive map- ping) with constraints of finitely many GMEPs, finitely many variational ...
40
A new smoothing modified three term conjugate gradient method for \(l {1}\) norm minimization problem
... optimization problem can be transformed into a general unconstrained optimization problem, which can be solved by the proposed smoothing modified three-term conjugate gradient ...
14
Horn formula minimization
... Horn minimization problem, simply put, is to find a minimal rep- resentation that is equivalent to a given Horn ...the problem of Horn minimization, we also study the relevant problem of ...
60
Minimization via duality
... The main goal of this paper is to exploit a simple observation of category theory that yields some striking results when applied to particular instances. The simple observation is this: a quotient construction in a ...
15
Composite Self-Concordant Minimization
... composite minimization problem (1) without increasing the original problem ...original problem structures that lead to computational ease in many cases ...
46
Multi-Line distance minimization: A visualized many-objective test problem suite
... distance minimization problem (ML-DMP), which are used to visually examine the behavior of many-objective ...ML-DMP problem are: 1) its Pareto optimal solutions lie in a regular polygon in the ...
20
Multi-line distance minimization: A visualized many-objective test problem suite
... distance minimization problem (ML-DMP), which are used to visually examine the behavior of many-objective ...ML-DMP problem are: 1) its Pareto optimal solutions lie in a regular polygon in the ...
23
The Complexity of Formula Minimization
... One reason that SPP formulae are useful in logic synthesis is that they allow for much smaller representations of many Boolean functions than DNF formulae. The simplest such example is that of the parity function. Since ...
41