- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2894
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
New Bregman proximal type algorithms for solving DC optimization problems ; volume:83 ; number:3 ; day:23 ; month:9 ; year:2022 ; pages:893-931 ; date:12.2022
Computational optimization and applications ; 83, Heft 3 (23.9.2022), 893-931, 12.2022
- Creator
-
Takahashi, Shota
Fukuda, Mituhiro
Tanaka, Mirai
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10589-022-00411-w
- URN
-
urn:nbn:de:101:1-2023020409053271679377
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Takahashi, Shota
- Fukuda, Mituhiro
- Tanaka, Mirai
- SpringerLink (Online service)
Other Objects (12)
Solving polyhedral d.c. optimization problems via concave minimization
Solving polyhedral d.c. optimization problems via concave minimization
An Effective Hybrid Metaheuristic Algorithm for Solving Global Optimization Algorithms
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
Proximal Markov chain Monte Carlo algorithms
Multiobjective trajectory optimization algorithms for solving multi-UAV-assisted mobile edge computing problem
Bregman proximal minimization algorithms, analysis and applications
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization
Solving optimization problems with MATLAB
Minimax and entropic proximal policy optimization
Improved teaching-learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Solving polyhedral d.c. optimization problems via concave minimization
Solving polyhedral d.c. optimization problems via concave minimization
An Effective Hybrid Metaheuristic Algorithm for Solving Global Optimization Algorithms
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
Proximal Markov chain Monte Carlo algorithms
Multiobjective trajectory optimization algorithms for solving multi-UAV-assisted mobile edge computing problem
Bregman proximal minimization algorithms, analysis and applications
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization
Solving optimization problems with MATLAB
Minimax and entropic proximal policy optimization
Improved teaching-learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Solving polyhedral d.c. optimization problems via concave minimization
Solving polyhedral d.c. optimization problems via concave minimization
An Effective Hybrid Metaheuristic Algorithm for Solving Global Optimization Algorithms
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
Proximal Markov chain Monte Carlo algorithms
Multiobjective trajectory optimization algorithms for solving multi-UAV-assisted mobile edge computing problem
Bregman proximal minimization algorithms, analysis and applications
On the asymptotic behavior of the Douglas–Rachford and proximal-point algorithms for convex optimization
Solving optimization problems with MATLAB
Minimax and entropic proximal policy optimization
Improved teaching-learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems