Skip to main navigation
Skip to search
Skip to main content
Technical University of Munich Home
Help & FAQ
English
Deutsch
Home
Profiles
Research units
Projects
Research output
Datasets
Prizes
Activities
Press/Media
Impacts
Search by expertise, name or affiliation
A piecewise conservative method for unconstrained convex optimization
A. Scagliotti
, P. Colli Franzone
Scuola Internazionale Superiore di Studi Avanzati
University of Pavia
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A piecewise conservative method for unconstrained convex optimization'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Piecewise
100%
Conservative Methods
100%
Restart Scheme
100%
Unconstrained Convex Optimization
100%
Convergence Results
66%
Strongly Convex Function
66%
Conservative Algorithm
66%
Optimization Methods
33%
Numerical Experiments
33%
Friction
33%
Kinetic Energy
33%
Gradient Method
33%
Criteria-based
33%
Dynamical Systems
33%
1 Regularization
33%
Iterative Optimization
33%
Fast Iterative Shrinkage-thresholding Algorithm (FISTA)
33%
Numerical Test
33%
Global Convergence
33%
Continuous Optimization
33%
Convex Problem
33%
Symplectic
33%
Fast Convergence Rate
33%
Composite Optimization
33%
Euler Discretization
33%
Massive Particles
33%
Nesterov Accelerated Gradient Method
33%
Restart Procedure
33%
Conservative Force Fields
33%
Non-strongly Convex
33%
Adaptive Restart
33%
Mathematics
Objective Function
100%
Convex Function
100%
Convergence Result
100%
Dynamical System
50%
Discretization
50%
Regularization
50%
Thresholding
50%
Generated -Field
50%
Continuous Time
50%
Numerical Experiment
50%
Convergence Rate
50%
Convex Problem
50%