Academic literature on the topic 'Proximal operator'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Proximal operator.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Proximal operator"

1

Li, Jia, Cong Fang, and Zhouchen Lin. "Lifted Proximal Operator Machines." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 4181–88. http://dx.doi.org/10.1609/aaai.v33i01.33014181.

Full text
Abstract:
We propose a new optimization method for training feedforward neural networks. By rewriting the activation function as an equivalent proximal operator, we approximate a feedforward neural network by adding the proximal operators to the objective function as penalties, hence we call the lifted proximal operator machine (LPOM). LPOM is block multiconvex in all layer-wise weights and activations. This allows us to use block coordinate descent to update the layer-wise weights and activations. Most notably, we only use the mapping of the activation function itself, rather than its derivative, thus
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Yixuan, Yuchao Tang, and Chuanxi Zhu. "Iterative Methods for Computing the Resolvent of Composed Operators in Hilbert Spaces." Mathematics 7, no. 2 (2019): 131. http://dx.doi.org/10.3390/math7020131.

Full text
Abstract:
The resolvent is a fundamental concept in studying various operator splitting algorithms. In this paper, we investigate the problem of computing the resolvent of compositions of operators with bounded linear operators. First, we discuss several explicit solutions of this resolvent operator by taking into account additional constraints on the linear operator. Second, we propose a fixed point approach for computing this resolvent operator in a general case. Based on the Krasnoselskii–Mann algorithm for finding fixed points of non-expansive operators, we prove the strong convergence of the sequen
APA, Harvard, Vancouver, ISO, and other styles
3

KHATIBZADEH, HADI, and SAJAD RANJBAR. "MONOTONE OPERATORS AND THE PROXIMAL POINT ALGORITHM IN COMPLETE CAT(0) METRIC SPACES." Journal of the Australian Mathematical Society 103, no. 1 (2016): 70–90. http://dx.doi.org/10.1017/s1446788716000446.

Full text
Abstract:
In this paper, we generalize monotone operators, their resolvents and the proximal point algorithm to complete CAT(0) spaces. We study some properties of monotone operators and their resolvents. We show that the sequence generated by the inexact proximal point algorithm $\unicode[STIX]{x1D6E5}$-converges to a zero of the monotone operator in complete CAT(0) spaces. A strong convergence (convergence in metric) result is also presented. Finally, we consider two important special cases of monotone operators and we prove that they satisfy the range condition (see Section 4 for the definition), whi
APA, Harvard, Vancouver, ISO, and other styles
4

INUWA, ADAMU YUSUF, PARIN CHAIPUNYA, POOM KUMAM, and SANI SALISU. "Equilibrium problems and proximal algorithm using tangent space products." Carpathian Journal of Mathematics 40, no. 1 (2023): 65–76. http://dx.doi.org/10.37193/cjm.2024.01.06.

Full text
Abstract:
This paper presents equilibrium problems and their regularized problems in the framework of Hadamard spaces. Using the concept of tangent space products, we introduce a resolvent operator and deduce essential properties in relation to equilibrium problem. Furthermore, we analyze the regularized problems involving resolvent operators. Finally, we establish two convergence results concerning proximal algorithms
APA, Harvard, Vancouver, ISO, and other styles
5

Rahaman, Mijanur, Rais Ahmad, Mohd Dilshad та Iqbal Ahmad. "RELAXED Η-PROXIMAL OPERATOR FOR SOLVING A VARIATIONAL-LIKE INCLUSION PROBLEM". Mathematical Modelling and Analysis 20, № 6 (2015): 819–35. http://dx.doi.org/10.3846/13926292.2015.1117026.

Full text
Abstract:
In this paper, we introduce a new resolvent operator and we call it relaxed η-proximal operator. We demonstrate some of the properties of relaxed η- proximal operator. By applying this concept, we consider and study a variational -like inclusion problem with a nonconvex functional. Based on relaxed η-proximal operator, we define an iterative algorithm to approximate the solutions of a variational-like inclusion problem and the convergence of the iterative sequences generated by the algorithm is also discussed. Our results can be treated as refinement of many previously known results. An exampl
APA, Harvard, Vancouver, ISO, and other styles
6

Ahmad, Rais, Arvind Kumar Rajpoot, Imran Ali, and Ching-Feng Wen. "Yosida Complementarity Problem with Yosida Variational Inequality Problem and Yosida Proximal Operator Equation Involving XOR-Operation." Journal of Mathematics 2021 (November 27, 2021): 1–15. http://dx.doi.org/10.1155/2021/9362630.

Full text
Abstract:
Due to the importance of Yosida approximation operator, we generalized the variational inequality problem and its equivalent problems by using Yosida approximation operator. The aim of this work is to introduce and study a Yosida complementarity problem, a Yosida variational inequality problem, and a Yosida proximal operator equation involving XOR-operation. We prove an existence result together with convergence analysis for Yosida proximal operator equation involving XOR-operation. For this purpose, we establish an algorithm based on fixed point formulation. Our approach is based on a proxima
APA, Harvard, Vancouver, ISO, and other styles
7

Rouhani, Behzad Djafari, and Vahid Mohebbi. "Strong Convergence Theorems for Resolvents of Accretive Operators with Possible Unbounded Errors." WSEAS TRANSACTIONS ON MATHEMATICS 23 (December 31, 2024): 1086–93. https://doi.org/10.37394/23206.2024.23.109.

Full text
Abstract:
In this paper, we study the convergence analysis of the sequence generated by an inexact proximal point method with unbounded errors to find zeros of m-accretive operators in Banach spaces. We prove the zero set of the operator is nonempty if and only if the generated sequence is bounded. In this case, we show that the generated sequence converges strongly to a zero of the operator. This process defines a sunny nonexpansive retraction from the Banach space onto the zero set of the operator. We present also some applications and numerical experiments for our results.
APA, Harvard, Vancouver, ISO, and other styles
8

Farajzadeh, A. P., S. Plubtieng, and K. Ungchittrakool. "On Best Proximity Point Theorems without Ordering." Abstract and Applied Analysis 2014 (2014): 1–5. http://dx.doi.org/10.1155/2014/130439.

Full text
Abstract:
Recently, Basha (2013) addressed a problem that amalgamates approximation and optimization in the setting of a partially ordered set that is endowed with a metric. He assumed that ifAandBare nonvoid subsets of a partially ordered set that is equipped with a metric andSis a non-self-mapping fromAtoB, then the mappingShas an optimal approximate solution, called a best proximity point of the mappingS, to the operator equationSx=x, whenSis a continuous, proximally monotone, ordered proximal contraction. In this note, we are going to obtain his results by omitting ordering, proximal monotonicity, a
APA, Harvard, Vancouver, ISO, and other styles
9

Moudafi, Abdellatif. "A remark on recent results for finding zeroes of accretive operators." Journal of Applied Mathematics and Stochastic Analysis 2006 (March 23, 2006): 1–6. http://dx.doi.org/10.1155/jamsa/2006/56704.

Full text
Abstract:
By means of the Yosida approximate of an accretive operator, we extended two recent results by Chidume and Chidume and Zegeye (2003) to set-valued operators, and we made the connection with two recent convergence results obtained by Benavides etal for a relaxed version of the so-called proximal point algorithm.
APA, Harvard, Vancouver, ISO, and other styles
10

Messina, Carmelo, Salvatore Gitto, Roberta Colombo, et al. "Short-Term Precision and Repeatability of Radiofrequency Echographic Multi Spectrometry (REMS) on Lumbar Spine and Proximal Femur: An In Vivo Study." Journal of Imaging 9, no. 6 (2023): 118. http://dx.doi.org/10.3390/jimaging9060118.

Full text
Abstract:
To determine the short-term intra-operator precision and inter-operator repeatability of radiofrequency echographic multi-spectrometry (REMS) at the lumbar spine (LS) and proximal femur (FEM). All patients underwent an ultrasound scan of the LS and FEM. Both precision and repeatability, expressed as root-mean-square coefficient of variation (RMS-CV) and least significant change (LSC) were obtained using data from two consecutive REMS acquisitions by the same operator or two different operators, respectively. The precision was also assessed in the cohort stratified according to BMI classificati
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Proximal operator"

1

Wytock, Matt. "Optimizing Optimization: Scalable Convex Programming with Proximal Operators." Research Showcase @ CMU, 2016. http://repository.cmu.edu/dissertations/785.

Full text
Abstract:
Convex optimization has developed a wide variety of useful tools critical to many applications in machine learning. However, unlike linear and quadratic programming, general convex solvers have not yet reached sufficient maturity to fully decouple the convex programming model from the numerical algorithms required for implementation. Especially as datasets grow in size, there is a significant gap in speed and scalability between general solvers and specialized algorithms. This thesis addresses this gap with a new model for convex programming based on an intermediate representation of convex pr
APA, Harvard, Vancouver, ISO, and other styles
2

Hübner, Ewgenij. "Proximal-ähnliche Verfahren für monotone Variationsungleichungen mit mengenwertigen Operatoren." Norderstedt Books on Demand GmbH, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=3005738&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hendrich, Christopher. "Proximal Splitting Methods in Nonsmooth Convex Optimization." Doctoral thesis, Universitätsbibliothek Chemnitz, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-149548.

Full text
Abstract:
This thesis is concerned with the development of novel numerical methods for solving nondifferentiable convex optimization problems in real Hilbert spaces and with the investigation of their asymptotic behavior. To this end, we are also making use of monotone operator theory as some of the provided algorithms are originally designed to solve monotone inclusion problems. After introducing basic notations and preliminary results in convex analysis, we derive two numerical methods based on different smoothing strategies for solving nondifferentiable convex optimization problems. The first approa
APA, Harvard, Vancouver, ISO, and other styles
4

Jirák, Jakub. "Alternativní JPEG kodér/dekodér." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2017. http://www.nusl.cz/ntk/nusl-317121.

Full text
Abstract:
The JPEG codec is currently the most widely used image format. This work deals with the design and implementation of an alternative JPEG codec using proximal algorithms in combination with the fixation of points from the original image to suppression of artifacts created in common JPEG coding. To solve the problem, the prox_TV and then the Douglas-Rachford algorithm were used, for which special functions using l_1-norm for image reconstruction were derived. The results of the proposed solution are very good because they can effectively suppress the artefacts created and the result corresponds
APA, Harvard, Vancouver, ISO, and other styles
5

Salim, Adil. "Random monotone operators and application to stochastic optimization." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLT021/document.

Full text
Abstract:
Cette thèse porte essentiellement sur l'étude d'algorithmes d'optimisation. Les problèmes de programmation intervenant en apprentissage automatique ou en traitement du signal sont dans beaucoup de cas composites, c'est-à-dire qu'ils sont contraints ou régularisés par des termes non lisses. Les méthodes proximales sont une classe d'algorithmes très efficaces pour résoudre de tels problèmes. Cependant, dans les applications modernes de sciences des données, les fonctions à minimiser se représentent souvent comme une espérance mathématique, difficile ou impossible à évaluer. C'est le cas dans les
APA, Harvard, Vancouver, ISO, and other styles
6

Salim, Adil. "Random monotone operators and application to stochastic optimization." Electronic Thesis or Diss., Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLT021.

Full text
Abstract:
Cette thèse porte essentiellement sur l'étude d'algorithmes d'optimisation. Les problèmes de programmation intervenant en apprentissage automatique ou en traitement du signal sont dans beaucoup de cas composites, c'est-à-dire qu'ils sont contraints ou régularisés par des termes non lisses. Les méthodes proximales sont une classe d'algorithmes très efficaces pour résoudre de tels problèmes. Cependant, dans les applications modernes de sciences des données, les fonctions à minimiser se représentent souvent comme une espérance mathématique, difficile ou impossible à évaluer. C'est le cas dans les
APA, Harvard, Vancouver, ISO, and other styles
7

Baygorrea, Cusihuallpa Nancy 1982. "Algoritmo do ponto proximal para operadores não monótonos." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306438.

Full text
Abstract:
Orientador: Roberto Andreani<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica<br>Made available in DSpace on 2018-08-22T06:15:13Z (GMT). No. of bitstreams: 1 BaygorreaCusihuallpa_Nancy_M.pdf: 1656614 bytes, checksum: 036b8eeb6a7f3e461c7ca051fed6fd3d (MD5) Previous issue date: 2013<br>Resumo: Esta dissertação desenvolve um estudo detalhado da convergência local do método de ponto proximal para resolver o problema de encontrar zeros de operadores maximais sem a condição de monotonicidade. Em particular, é estudada a con
APA, Harvard, Vancouver, ISO, and other styles
8

Martincová, Lucia. "Odlišení pozadí a pohybujících se objektů ve videosekvenci." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2017. http://www.nusl.cz/ntk/nusl-319269.

Full text
Abstract:
This diploma thesis deals with separation of backgroud and moving objects in video. Video can be represented as series of frames and each frame represented as low - rank structure - matrix. This thesis describe sparse representation of signals and robust principal component analysis. It also presents and implements algorithms - models for reconstruction of real video.
APA, Harvard, Vancouver, ISO, and other styles
9

Komůrková, Lucia. "Odlišení pozadí a pohybujících se objektů ve videosekvenci." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2018. http://www.nusl.cz/ntk/nusl-254387.

Full text
Abstract:
This diploma thesis deals with separation of backgroud and moving objects in video. Video can be represented as series of frames and each frame represented as low - rank structure - matrix. This thesis describe sparse representation of signals and robust principal component analysis. It also presents and implements algorithms - models for reconstruction of real video.
APA, Harvard, Vancouver, ISO, and other styles
10

Badri, Hicham. "Sparse and Scale-Invariant Methods in Image Processing." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0139/document.

Full text
Abstract:
Dans cette thèse, on présente de nouvelles approches à base de parcimonie et d'invariance d' échelle pour le développement de techniques rapides et efficaces en traitement d'images. Au lieu d'utiliser la norme l1 pour imposer la parcimonie, on exploite plutôt des pénalités non-convexes qui encouragent plus la parcimonie. On propose une approche de premier ordre pour estimer une solution d'un opérateur proximal non-convexe, ce qui permet d'exploiter facilement la non-convexité. On étudie aussi le problème de pluri-parcimonie quand le problème d'optimisation est composé de plusieurs termes parci
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Proximal operator"

1

Meyers, Bennet E. Signal Decomposition Using Masked Proximal Operators. Now Publishers, 2023.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Grant, Stuart A., and David B. Auyong. Lower Limb Ultrasound Guided Regional Anesthesia. Oxford University Press, 2016. http://dx.doi.org/10.1093/med/9780190231804.003.0003.

Full text
Abstract:
This chapter describes the clinical anatomy relevant to the lower extremities and outlines the tools and techniques used to perform lower extremity ultrasound-guided nerve blocks. The nerve blocks described here include the femoral, lateral femoral cutaneous, adductor canal (selective femoral), saphenous, obturator, lumbar plexus, sciatic (proximal, anterior, and popliteal approaches), (iPACK) and ankle blocks. For each nerve block, the indications, risks, and benefits of the varying approaches are described in detail. The chapter includes step-by-step instructions with illustrations, includin
APA, Harvard, Vancouver, ISO, and other styles
3

Meloy, J. Reid, and Jens Hoffmann, eds. International Handbook of Threat Assessment. 2nd ed. Oxford University Press, 2021. http://dx.doi.org/10.1093/med-psych/9780190940164.001.0001.

Full text
Abstract:
The International Handbook of Threat Assessment, second edition, is a broad and deep exploration of the discipline of threat assessment and management, reflecting the magnitude of growth in this burgeoning scientific field over the past decade. Divided into three sections—foundations, fields of practice, and operations—this volume’s contributors include virtually all experts from the global community. New areas of work are emphasized, including lone actor terrorism, cyberthreats, insider threats, false allegations and bystanders. Established areas of work are further delineated, including work
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Proximal operator"

1

Orenstein, Shmuel, Zhenghan Fang, Hyeong-Geol Shin, Peter van Zijl, Xu Li, and Jeremias Sulam. "ProxiMO: Proximal Multi-operator Networks for Quantitative Susceptibility Mapping." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-78761-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Grad, Sorin-Mihai. "A Survey on Proximal Point Type Algorithms for Solving Vector Optimization Problems." In Splitting Algorithms, Modern Operator Theory, and Applications. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25939-6_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Attouch, Hedy, and Juan Peypouquet. "Convergence Rate of Proximal Inertial Algorithms Associated with Moreau Envelopes of Convex Functions." In Splitting Algorithms, Modern Operator Theory, and Applications. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25939-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yamada, Isao, and Masao Yamagishi. "Hierarchical Convex Optimization by the Hybrid Steepest Descent Method with Proximal Splitting Operators—Enhancements of SVM and Lasso." In Splitting Algorithms, Modern Operator Theory, and Applications. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-25939-6_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Qing, Bin Xin, and Jie Chen. "Distributed Convex Nonsmooth Optimization for Multi-agent System Based on Proximal Operator." In Distributed Cooperative Control and Optimization for Multi-Agent Systems. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-0950-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lan, Heng-you, Xiao Wang, Tingjian Xiong, and Yumin Xiang. "An Over-Relaxed (A,η,m)-Proximal Point Algorithm for System of Nonlinear Fuzzy-Set Valued Operator Equation Frameworks and Fixed Point Problems." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24918-1_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zaslavski, Alexander J. "Maximal Monotone Operators and the Proximal Point Algorithm." In Springer Optimization and Its Applications. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30921-7_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kaplan, A., and R. Tichatschke. "Proximal Methods for Variational Inequalities with Set-Valued Monotone Operators." In Nonconvex Optimization and Its Applications. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4613-0287-2_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kaplan, A., and R. Tichatschke. "Multi–Step Proximal Method for Variational Inequalities with Monotone Operators." In Lecture Notes in Economics and Mathematical Systems. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59073-3_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kaplan, A., and R. Tichatschke. "On New Proximal Methods for Elliptic Variational Inequalities (Case of Symmetric Operators)." In Lecture Notes in Economics and Mathematical Systems. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-642-46823-0_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Proximal operator"

1

Zou, Yinan, Yong Zhou, Yuanming Shi, and Xu Chen. "Learning Proximal Operator Methods for Massive Connectivity in IoT Networks." In GLOBECOM 2021 - 2021 IEEE Global Communications Conference. IEEE, 2021. http://dx.doi.org/10.1109/globecom46510.2021.9685447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hu, Shih-Wei, Gang-Xuan Lin, and Chun-Shien Lu. "GPX-ADMM-Net: ADMM-based Neural Network with Generalized Proximal Operator." In 2020 28th European Signal Processing Conference (EUSIPCO). IEEE, 2021. http://dx.doi.org/10.23919/eusipco47968.2020.9287399.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Srinivasan, Manikantan, and C. Siva Ram Murthy. "Proximal spectrum access: A QoE-driven inter-operator spectrum sharing paradigm." In 2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). IEEE, 2015. http://dx.doi.org/10.1109/pimrc.2015.7343584.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gu, Bin, Xingwang Ju, Xiang Li, and Guansheng Zheng. "Faster Training Algorithms for Structured Sparsity-Inducing Norm." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/299.

Full text
Abstract:
Structured-sparsity regularization is popular for sparse learning because of its flexibility of encoding the feature structures. This paper considers a generalized version of structured-sparsity regularization (especially for $l_1/l_{\infty}$ norm) with arbitrary group overlap. Due to the group overlap, it is time-consuming to solve the associated proximal operator. Although Mairal~\shortcite{mairal2010network} have proposed a network-flow algorithm to solve the proximal operator, it is still time-consuming especially in the high-dimensional setting. To address this challenge, in this paper, w
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Zhenni, Shuxue Ding, Yujie Li, and Wuhui Chen. "Dictionary learning with ℓ1/2 regularizer for sparsity based on proximal operator." In 2015 IEEE 7th International Conference on Awareness Science and Technology (iCAST). IEEE, 2015. http://dx.doi.org/10.1109/icawst.2015.7314029.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Zhenni, Takafumi Hayashi, Shuxue Ding, and Xiang Li. "An efficient algorithm for incoherent analysis dictionary learning based on proximal operator." In 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, 2016. http://dx.doi.org/10.1109/smc.2016.7844782.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Qing, Xianlin Zeng, Bin Xin, and Jie Chen. "Distributed convex nonsmooth optimization for multi-agent system based on proximal operator." In 2019 IEEE 15th International Conference on Control and Automation (ICCA). IEEE, 2019. http://dx.doi.org/10.1109/icca.2019.8899755.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Shijun, Baocheng Zhu, Lintao Ma, and Yuan Qi. "A Riemannian Primal-dual Algorithm Based on Proximal Operator and its Application in Metric Learning." In 2019 International Joint Conference on Neural Networks (IJCNN). IEEE, 2019. http://dx.doi.org/10.1109/ijcnn.2019.8852367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sankaran, Raman, Francis Bach, and Chiranjib Bhattacharyya. "Learning With Subquadratic Regularization : A Primal-Dual Approach." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/272.

Full text
Abstract:
Subquadratic norms have been studied recently in the context of structured sparsity, which has been shown to be more beneficial than conventional regularizers in applications such as image denoising, compressed sensing, banded covariance estimation, etc. While existing works have been successful in learning structured sparse models such as trees, graphs, their associated optimization procedures have been inefficient because of hard-to-evaluate proximal operators of the norms. In this paper, we study the computational aspects of learning with subquadratic norms in a general setup. Our main cont
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Zhenni, Shuxue Ding, Takafumi Hayashi, Wuhui Chen, and Yujie Li. "An efficient algorithm for dictionary learning with a mixed-norm regularizer for sparsity based on proximal operator." In 2015 9th International Conference on Signal Processing and Communication Systems (ICSPCS). IEEE, 2015. http://dx.doi.org/10.1109/icspcs.2015.7391739.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Proximal operator"

1

Gray, Steven, Robert Chevalier, Nicholas DiLeo, et al. Trusted Remote Operation of Proximate Emergy Robots (TROOPER): DARPA Robotics Challenge. Defense Technical Information Center, 2015. http://dx.doi.org/10.21236/ad1002601.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lacerda Silva, P., G. R. Chalmers, A. M. M. Bustin, and R. M. Bustin. Gas geochemistry and the origins of H2S in the Montney Formation. Natural Resources Canada/CMSS/Information Management, 2022. http://dx.doi.org/10.4095/329794.

Full text
Abstract:
The geology of the Montney Formation and the geochemistry of its produced fluids, including nonhydrocarbon gases such as hydrogen sulfide were investigated for both Alberta and BC play areas. Key parameters for understanding a complex petroleum system like the Montney play include changes in thickness, depth of burial, mass balance calculations, timing and magnitudes of paleotemperature exposure, as well as kerogen concentration and types to determine the distribution of hydrocarbon composition, H2S concentrations and CO2 concentrations. Results show that there is first-, second- and third- or
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!