Jove
Visualize
Contact Us

Related Concept Videos

Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

73
A nonlinear inequality describes a comparison involving an expression that curves or behaves more complexly than a straight line. These inequalities often appear in forms that include squares, products, or variables in the denominator.To solve such an inequality, one starts by rewriting it so that zero appears on one side. For example, the inequality:  can be factored as: This form makes it easier to identify the values that cause the expression to equal zero. In this case, the key values...
73
Cartesian Form for Vector Formulation01:26

Cartesian Form for Vector Formulation

938
The Cartesian form for vector formulation is a process to calculate  the moment of force using the position and force vectors. The moment of force is defined as the cross-product of these vectors, making it a vector quantity. The Cartesian form of the position and force vectors involves unit vectors, which can be used to express the cross-product in determinant form.
938
Introduction to Nonlinear Inequalities01:25

Introduction to Nonlinear Inequalities

66
Linear and nonlinear inequalities are fundamental for analyzing variable relationships and identifying ranges satisfying specific conditions. A linear inequality involves variables raised only to the first power, resulting in a straight-line graph. This line partitions the coordinate plane into two distinct regions: one that satisfies the inequality and one that does not. Each region represents a set of solutions where the linear relationship holds true under the specified constraint.Nonlinear...
66
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

174
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
174
Inertia Tensor01:24

Inertia Tensor

841
The concept of the inertia tensor is employed to depict the mass distribution and rotational inertia of a solid or rigid object. This tensor is expressed through a three-by-three matrix. Each component within this matrix corresponds to varying moments of inertia about specific axes.
The diagonal components of the inertia tensor matrix represent the moments of inertia concerning the principal axes of the object. These primary axes are defined as the axes where the object experiences the least...
841
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

18.2K
It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
18.2K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Quartic Regularity.

Vietnam journal of mathematics·2025
Same author

Tensor methods for finding approximate stationary points of convex functions.

Optimization methods & software·2025
Same author

Primal Subgradient Methods with Predefined Step Sizes.

Journal of optimization theory and applications·2024
Same author

[Multidisciplinary consensus on the use of Cereton drug in treatment of central nervous system diseases with cognitive impairments of congenital and acquired origin in children. Resolution of the multidisciplinary panel of experts].

Zhurnal nevrologii i psikhiatrii imeni S.S. Korsakova·2024
Same author

Gradient regularization of Newton method with Bregman distances.

Mathematical programming·2024
Same author

Local convergence of tensor methods.

Mathematical programming·2022
Same journal

A better-than-1.6-approximation for prize-collecting TSP.

Mathematical programming·2026
Same journal

A <math><mrow><mfrac><mn>4</mn> <mn>3</mn></mfrac></mrow></math> -approximation for the maximum leaf spanning arborescence problem in DAGs.

Mathematical programming·2026
Same journal

An FPTAS for Connectivity Interdiction.

Mathematical programming·2026
Same journal

A first order method for linear programming parameterized by circuit imbalance.

Mathematical programming·2026
Same journal

Tight lower bounds for block-structured integer programs.

Mathematical programming·2026
Same journal

Accelerated first-order optimization under nonlinear constraints.

Mathematical programming·2026
See all related articles
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Video

Updated: Nov 16, 2025

Deep Neural Networks for Image-Based Dietary Assessment
13:19

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

9.7K

Implementable tensor methods in unconstrained convex optimization.

Yurii Nesterov1

  • 1Center for Operations Research and Econometrics (CORE), Catholic University of Louvain (UCL), Louvain-la-Neuve, Belgium.

Mathematical Programming
|February 25, 2021
PubMed
Summary
This summary is machine-generated.

New tensor methods accelerate convex optimization by solving auxiliary polynomial minimization problems. These third-order methods achieve near-optimal convergence rates efficiently, rivaling second-order methods in computational cost.

Keywords:
Convex optimizationHigh-order methodsLower complexity boundsTensor methodsWorst-case complexity bounds

More Related Videos

A Contusive Model of Unilateral Cervical Spinal Cord Injury Using the Infinite Horizon Impactor
07:28

A Contusive Model of Unilateral Cervical Spinal Cord Injury Using the Infinite Horizon Impactor

Published on: July 24, 2012

20.0K
An Experimental Protocol for Assessing the Performance of New Ultrasound Probes Based on CMUT Technology in Application to Brain Imaging
16:01

An Experimental Protocol for Assessing the Performance of New Ultrasound Probes Based on CMUT Technology in Application to Brain Imaging

Published on: September 24, 2017

10.7K

Related Experiment Videos

Last Updated: Nov 16, 2025

Deep Neural Networks for Image-Based Dietary Assessment
13:19

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

9.7K
A Contusive Model of Unilateral Cervical Spinal Cord Injury Using the Infinite Horizon Impactor
07:28

A Contusive Model of Unilateral Cervical Spinal Cord Injury Using the Infinite Horizon Impactor

Published on: July 24, 2012

20.0K
An Experimental Protocol for Assessing the Performance of New Ultrasound Probes Based on CMUT Technology in Application to Brain Imaging
16:01

An Experimental Protocol for Assessing the Performance of New Ultrasound Probes Based on CMUT Technology in Application to Brain Imaging

Published on: September 24, 2017

10.7K

Area of Science:

  • Optimization Theory
  • Numerical Analysis
  • Applied Mathematics

Background:

  • Unconstrained convex optimization is fundamental in machine learning and operations research.
  • Existing second-order methods face limitations in convergence speed and computational cost for complex problems.
  • Tensor methods offer a promising avenue for improving optimization efficiency.

Purpose of the Study:

  • To develop and analyze novel tensor methods for unconstrained convex optimization.
  • To investigate the convergence rates and computational efficiency of these new methods.
  • To enhance the practical implementability and performance of third-order optimization techniques.

Main Methods:

  • Development of new tensor methods involving auxiliary polynomial minimization.
  • Analysis of a basic scheme and its accelerated version using estimating sequences.
  • Comparison of convergence rates against worst-case lower complexity bounds.
  • Application of relative smoothness conditions for efficient auxiliary problem solving.

Main Results:

  • The proposed accelerated third-order tensor method achieves a function value convergence rate of O(1/k^2).
  • This rate is shown to be close to the theoretical lower bound for this class of problems.
  • The computational cost per iteration remains comparable to traditional second-order methods in many cases.
  • Third-order methods are made practical and highly efficient through the new technique.

Conclusions:

  • The developed tensor methods significantly advance the state-of-the-art in unconstrained convex optimization.
  • Third-order methods, when efficiently implemented, offer a compelling alternative to existing techniques.
  • These findings have broad implications for computationally intensive optimization tasks.