skip to main content
Language:
Search Limited to: Search Limited to: Resource type Show Results with: Show Results with: Search type Index

Results 1 - 20 of 15,679  for All Library Resources

Sorted by: Sorted by: RelevanceOr hit Enter to replace sort method
Results 1 2 3 4 5 next page
Show only
Refined by: subject: Algorithms remove
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Optimization with Sparsity-Inducing Penalties
Optimization with Sparsity-Inducing Penalties
Material Type:
Book 		Add to My Research

Optimization with Sparsity-Inducing Penalties

Foundations and trends in machine learning, 2012 [Peer Reviewed Journal]

Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 1935-8237 ;EISSN: 1935-8245 ;DOI: 10.1561/2200000015

Digital Resources/Online E-Resources

Citations Cited by
2
The derivatives of Sinkhorn-Knopp converge
The derivatives of Sinkhorn-Knopp converge
Material Type:
Article 		Add to My Research

The derivatives of Sinkhorn-Knopp converge

SIAM journal on optimization, 2023, Vol.33 (3) [Peer Reviewed Journal]

2022. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;Distributed under a Creative Commons Attribution 4.0 International License ;ISSN: 1052-6234 ;EISSN: 2331-8422 ;EISSN: 1095-7189 ;DOI: 10.48550/arxiv.2207.12717

Full text available

Citations Cited by
3
Toric Geometry of Entropic Regularization
Toric Geometry of Entropic Regularization
Material Type:
Article 		Add to My Research

Toric Geometry of Entropic Regularization

arXiv.org, 2022-02 [Peer Reviewed Journal]

2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2202.01571

Full text available

Citations Cited by
4
Unbalanced Optimal Transport, from Theory to Numerics
Unbalanced Optimal Transport, from Theory to Numerics
Material Type:
Article 		Add to My Research

Unbalanced Optimal Transport, from Theory to Numerics

arXiv.org, 2023-01 [Peer Reviewed Journal]

2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2211.08775

Full text available

Citations Cited by
5
Variance-reduction for Variational Inequality Problems with Bregman Distance Function
Variance-reduction for Variational Inequality Problems with Bregman Distance Function
Material Type:
Article 		Add to My Research

Variance-reduction for Variational Inequality Problems with Bregman Distance Function

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.10735

Full text available

Citations Cited by
6
Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport
Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport
Material Type:
Article 		Add to My Research

Improved Complexity Analysis of the Sinkhorn and Greenkhorn Algorithms for Optimal Transport

arXiv.org, 2023-10

2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2305.14939

Full text available

Citations Cited by
7
high-order proximal point algorithm for the monotone variational inequality problem and its application
high-order proximal point algorithm for the monotone variational inequality problem and its application
Material Type:
Article 		Add to My Research

high-order proximal point algorithm for the monotone variational inequality problem and its application

arXiv.org, 2023-08

2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2308.07689

Full text available

Citations Cited by
8
A novel approach to find the minimum of real functions and an anomalous test function
A novel approach to find the minimum of real functions and an anomalous test function
Material Type:
Article 		Add to My Research

A novel approach to find the minimum of real functions and an anomalous test function

arXiv.org, 2023-07

2023. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2307.10427

Full text available

Citations Cited by
9
Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules
Material Type:
Article 		Add to My Research

Optimal Convergence Rate for Mirror Descent Methods with special Time-Varying Step Sizes Rules

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2401.04754

Full text available

Citations Cited by
10
Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems
Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems
Material Type:
Article 		Add to My Research

Adaptive Variant of Frank-Wolfe Method for Relative Smooth Convex Optimization Problems

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.12948

Full text available

Citations Cited by
11
Effective Front-Descent Algorithms with Convergence Guarantees
Effective Front-Descent Algorithms with Convergence Guarantees
Material Type:
Article 		Add to My Research

Effective Front-Descent Algorithms with Convergence Guarantees

arXiv.org, 2024-05

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.08450

Full text available

Citations Cited by
12
Duality-based single-level reformulations of bilevel optimization problems
Duality-based single-level reformulations of bilevel optimization problems
Material Type:
Article 		Add to My Research

Duality-based single-level reformulations of bilevel optimization problems

arXiv.org, 2024-05

2024. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by-nc-nd/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2405.07672

Full text available

Citations Cited by
13
Projective splitting with backward, half-forward and proximal-Newton steps
Projective splitting with backward, half-forward and proximal-Newton steps
Material Type:
Article 		Add to My Research

Projective splitting with backward, half-forward and proximal-Newton steps

arXiv.org, 2024-05

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2208.10680

Full text available

Citations Cited by
14
Multi-Agent Coverage Control with Transient Behavior Consideration
Multi-Agent Coverage Control with Transient Behavior Consideration
Material Type:
Article 		Add to My Research

Multi-Agent Coverage Control with Transient Behavior Consideration

arXiv.org, 2024-04

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2404.05995

Full text available

Citations Cited by
15
Popov Mirror-Prox for solving Variational Inequalities
Popov Mirror-Prox for solving Variational Inequalities
Material Type:
Article 		Add to My Research

Popov Mirror-Prox for solving Variational Inequalities

arXiv.org, 2024-03

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2404.00635

Full text available

Citations Cited by
16
Review of Large-Scale Simulation Optimization
Review of Large-Scale Simulation Optimization
Material Type:
Article 		Add to My Research

Review of Large-Scale Simulation Optimization

arXiv.org, 2024-03

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2403.15669

Full text available

Citations Cited by
17
A Unified Inexact Stochastic ADMM for Composite Nonconvex and Nonsmooth Optimization
A Unified Inexact Stochastic ADMM for Composite Nonconvex and Nonsmooth Optimization
Material Type:
Article 		Add to My Research

A Unified Inexact Stochastic ADMM for Composite Nonconvex and Nonsmooth Optimization

arXiv.org, 2024-03

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2403.02015

Full text available

Citations Cited by
18
Inexact Restoration via random models for unconstrained noisy optimization
Inexact Restoration via random models for unconstrained noisy optimization
Material Type:
Article 		Add to My Research

Inexact Restoration via random models for unconstrained noisy optimization

arXiv.org, 2024-02

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2402.12069

Full text available

Citations Cited by
19
Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition
Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition
Material Type:
Article 		Add to My Research

Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition

arXiv.org, 2024-02

2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://arxiv.org/licenses/nonexclusive-distrib/1.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2307.12725

Full text available

Citations Cited by
20
Theoretical smoothing frameworks for general nonsmooth bilevel problems
Theoretical smoothing frameworks for general nonsmooth bilevel problems
Material Type:
Article 		Add to My Research

Theoretical smoothing frameworks for general nonsmooth bilevel problems

arXiv.org, 2024-01

2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. ;http://creativecommons.org/licenses/by/4.0 ;EISSN: 2331-8422 ;DOI: 10.48550/arxiv.2401.17852

Full text available

Citations Cited by

Results 1 - 20 of 15,679  for All Library Resources

Sorted by: Sorted by: RelevanceOr hit Enter to replace sort method
Results 1 2 3 4 5 next page

Personalize your results

  1. Edit

Refine Search Results

Expand My Results

  1.   

Show only

  1. Peer-reviewed Journals (4)

Refine My Results

Creation Date 

From To
Refine
  1. Before 2009  (100)
  2. 2009 To 2011  (463)
  3. 2012 To 2014  (1,191)
  4. 2015 To 2018  (3,332)
  5. After 2018  (10,594)
  6. More options open sub menu

Resource Type 

  1. Articles  (15,670)
  2. Conference Proceedings  (7)
  3. Text Resources  (1)
  4. Books  (1)
  5. More options open sub menu
INSPIRE LIBRARY - TON DUC THANG UNIVERSITY (84-028) 37 755 057 Feedback
19 Nguyen Huu Tho St. Dist.7, HCM thuvien@tdtu.edu.vn

Copyright © 2017 INSPIRE LIBRARY - TON DUC THANG UNIVERSITY

Searching Remote Databases, Please Wait