Results 11 to 20 of about 19,699 (306)

Strong Convergence of Modified Algorithms Based on the Regularization for the Constrained Convex Minimization Problem [PDF]

open access: yesAbstract and Applied Analysis, 2014
As is known, the regularization method plays an important role in solving constrained convex minimization problems. Based on the idea of regularization, implicit and explicit iterative algorithms are proposed in this paper and the sequences generated by ...
Ming Tian, Jun-Ying Gong
doaj   +2 more sources

Hybrid Gradient-Projection Algorithm for Solving Constrained Convex Minimization Problems with Generalized Mixed Equilibrium Problems [PDF]

open access: yesJournal of Function Spaces and Applications, 2012
It is well known that the gradient-projection algorithm (GPA) for solving constrained convex minimization problems has been proven to have only weak convergence unless the underlying Hilbert space is finite dimensional.
Lu-Chuan Ceng, Ching-Feng Wen
doaj   +2 more sources

Deblurring by Solving a TVp-Regularized Optimization Problem Using Split Bregman Method

open access: yesAdvances in Multimedia, 2014
Image deblurring is formulated as an unconstrained minimization problem, and its penalty function is the sum of the error term and TVp-regularizers with ...
Su Xiao
doaj   +1 more source

SVD as a preconditioner in nonlinear optimization

open access: yesComputer Assisted Methods in Engineering and Science, 2017
Finding a solution of nonlinear constrained optimization problem may be very computer resources consuming, regardless of solution method adopted. A conceptually simple preconditioning procedure, based on singular value decomposition (SVD), is proposed ...
MichaƂ Pazdanowski
doaj   +1 more source

On the unconstrained optimization reformulations for a class of stochastic vector variational inequality problems

open access: yesJournal of Inequalities and Applications, 2023
In this paper, a class of stochastic vector variational inequality (SVVI) problems are considered. By employing the idea of a D-gap function, the SVVI problem is reformulated as a deterministic model, which is an unconstrained expected residual ...
Dan-dan Dong, Guo-ji Tang, Hui-ming Qiu
doaj   +1 more source

Minimal Load Constrained Vehicle Routing Problems [PDF]

open access: yes, 2005
In this paper, the Capacitated Vehicle Routing Problem is extended to the case where each vehicle is restricted to an additional minimal starting or returning load constraint. We refer to this extension as the Minimal Load Constrained Vehicle Routing Problem. We present integer programming formulations for single and multidepot cases.
Imdat Kara, Tolga Bektas
openaire   +1 more source

An efficient approach to constrained via minimization for two-layer VLSI routing [PDF]

open access: yes, 1999
Constrained Via Minimization is the problem of reassigning wire segments of a VLSI routing so that the number of vias is minimized. In this paper, a new approach is proposed for two-layer VLSI routing. This approach is able to handle any types of routing,
Hon Nin Cheung   +5 more
core   +1 more source

An Augmented Penalization Algorithm for the Equality Constrained Minimization Problem

open access: yesTrends in Computational and Applied Mathematics, 2002
In this contribution an iterative method for solving the nonlinear minimization problem with equality constraints is presented. The method is based on the sequential minimization of the differentiable penalization function known as augmented Lagrangian ...
M.C. MACIEL, G.N. SOTTOSANTO
doaj   +1 more source

Minimizers of a Class of Constrained Vectorial Variational Problems: Part I. [PDF]

open access: yesMilan Journal of Mathematics, 2014
In this paper, we prove the existence of minimizers of a class of multi-constrained variational problems. We consider systems involving a nonlinearity that does not satisfy compactness, monotonicity, neither symmetry properties. Our approach hinges on the concentration-compactness approach.
Hajaiej, Hichem   +2 more
openaire   +3 more sources

An Objective Penalty Function-Based Method for Inequality Constrained Minimization Problem [PDF]

open access: yes, 2018
For inequality constrained minimization problem, we first propose a new exact nonsmooth objective penalty function and then apply a smooth technique to the penalty function to make it smooth.
Shujun Lian, Sitong Meng, Yiju Wang
core   +1 more source

Home - About - Disclaimer - Privacy