Results 1 to 10 of about 117,656 (306)

Penalty methods for a variational quantum eigensolver [PDF]

open access: yesPhysical Review Research, 2021
The variational quantum eigensolver (VQE) is a promising algorithm to compute eigenstates and eigenenergies of a given quantum system that can be performed on a near-term quantum computer.
Kohdai Kuroiwa, Yuya O. Nakagawa
doaj   +3 more sources

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM [PDF]

open access: yesIEEE Open Journal of Signal Processing
This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components.
Luke Lozenski   +2 more
doaj   +2 more sources

Decrease of the Penalty Parameter in Differentiable Penalty Function Methods

open access: yesTheoretical Economics Letters, 2011
We propose a simple modification to the differentiable penalty methods for solving nonlinear programming problems. This modification decreases the penalty parameter and the ill-conditioning of the penalty method and leads to a faster convergence to the optimal solution.
Roohollah Aliakbari Shandiz   +1 more
exaly   +3 more sources

Ensemble Linear Subspace Analysis of High-Dimensional Data

open access: yesEntropy, 2021
Regression models provide prediction frameworks for multivariate mutual information analysis that uses information concepts when choosing covariates (also called features) that are important for analysis and prediction.
S. Ejaz Ahmed, Saeid Amiri, Kjell Doksum
doaj   +1 more source

Space-log: a novel approach to inferring gene-gene net-works using SPACE model with log penalty [version 2; peer review: 2 approved, 1 approved with reservations]

open access: yesF1000Research, 2022
Gene expression data have been used to infer gene-gene networks (GGN) where an edge between two genes implies the conditional dependence of these two genes given all the other genes.
Wei Sun, Qian (Vicky) Wu, Li Hsu
doaj   +1 more source

On two recent nonconvex penalties for regularization in machine learning

open access: yesResults in Applied Mathematics, 2022
Regularization methods are often employed to reduce overfitting of machine learning models. Nonconvex penalty functions are often considered for regularization because of their near-unbiasedness properties.
Sujit Vettam, Majnu John
doaj   +1 more source

The Multi-Objective Transportation Problem Solve with Geometric Mean and Penalty Methods

open access: yesIndonesian Journal of Innovation and Applied Sciences, 2023
The traditional (classical) Transportation Problem (TP) can be viewed as a specific case of the Linear Programming (LP) problem, as well as its models are used to find the best solution for the problem of predetermined how many units of a good or service
K.P.O.Niluminda, E.M.U.S.B.Ekanayake
doaj   +1 more source

Incremental learning of material absorption coefficient regression based on parameter penalty and experience replay

open access: yes工程科学学报, 2023
Material data are prepared in batches and stages, and data distribution in different batches varies. However, the average accuracy of neural networks declines when learning material data by batch, resulting in great challenges to the application of ...
Hong-ye WANG, Quan QIAN, Xing WU
doaj   +1 more source

LASSO type penalized spline regression for binary data

open access: yesBMC Medical Research Methodology, 2021
Background Generalized linear mixed models (GLMMs), typically used for analyzing correlated data, can also be used for smoothing by considering the knot coefficients from a regression spline as random effects.
Muhammad Abu Shadeque Mullah   +2 more
doaj   +1 more source

A quadratic penalty method for hypergraph matching [PDF]

open access: yesJournal of Global Optimization, 2017
Hypergraph matching is a fundamental problem in computer vision. Mathematically speaking, it maximizes a polynomial objective function, subject to assignment constraints. In this paper, we reformulate the hypergraph matching problem as a sparse constrained tensor optimization problem.
Chunfeng Cui   +3 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy