Jove
Visualize
Contact Us
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 Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

40
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...
40
Molecular Weight of Step-Growth Polymers01:08

Molecular Weight of Step-Growth Polymers

2.2K
Step growth polymerization involves bi or multifunctional monomers. Bifunctional monomers react to form linear step growth polymers, whereas multifunctional monomers react to form non-linear or branched polymers.
As the step-growth polymerization involves step-wise condensation of monomers, the molecular weight also builds up eventually. Consequently, high molecular weight polymers are obtained at the late stages of the polymerization, where 99% of monomers have been consumed.
The extent of the...
2.2K
Gradually Varying Flow01:29

Gradually Varying Flow

34
Gradually varying flow (GVF) in open channels describes situations where water depth changes slowly along the channel due to factors like non-uniform bed slope, channel shape variations, or obstructions. This flow type occurs when the depth adjusts gradually to balance gravitational forces, shear forces, and energy requirements, resulting in a low rate of depth change.Characteristics of Gradually Varying FlowGVF is commonly observed in natural streams, rivers, and canals, where flow depth...
34
Step-Growth Polymerization: Overview01:03

Step-Growth Polymerization: Overview

3.4K
Step-growth or condensation polymerization is a stepwise reaction of bi or multifunctional monomers to form long-chain polymers. As all the monomers are reactive, most of the monomers are consumed at the early stages of the reaction to form small chains of reactive oligomers, which then combine to form long polymer chains in the late stages. Hence, the reaction has to proceed for a long time to achieve high molecular weight polymers.
Many natural and synthetic polymers are produced by...
3.4K

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

[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 author

Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method.

Journal of optimization theory and applications·2021
Same journal

Asymptotic Regularity of a Generalised Stochastic Halpern Scheme.

Journal of optimization theory and applications·2026
Same journal

Optimal Multi-Drug Therapies for Antimicrobial Resistance with Horizontal Transfer.

Journal of optimization theory and applications·2026
Same journal

S-shaped Utility Maximization with VaR Constraint and Partial Information.

Journal of optimization theory and applications·2026
Same journal

A Positive Semidefinite Safe Approximation of Multivariate Distributionally Robust Constraints Determined by Simple Functions.

Journal of optimization theory and applications·2025
Same journal

Generalized Robust Optimization using the Notion of Set-Valued Probability.

Journal of optimization theory and applications·2025
Same journal

ABB Theorems: Results and Limitations in Infinite Dimensions.

Journal of optimization theory and applications·2025
See all related articles

Related Experiment Video

Updated: Jun 5, 2025

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation
13:04

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation

Published on: January 18, 2022

3.8K

Primal Subgradient Methods with Predefined Step Sizes.

Yurii Nesterov1

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

Journal of Optimization Theory and Applications
|December 12, 2024
PubMed
Summary
This summary is machine-generated.

This study introduces a new framework for analyzing primal subgradient methods in constrained nonsmooth convex optimization. Modified step-size rules accelerate these schemes, even for problems with unbounded feasible sets.

Keywords:
Constrained problemsConvex optimizationNonsmooth optimizationOptimal Lagrange multipliersSubgradient methods

More Related Videos

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

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

9.0K
Preparation of Synaptic Plasma Membrane and Postsynaptic Density Proteins Using a Discontinuous Sucrose Gradient
08:06

Preparation of Synaptic Plasma Membrane and Postsynaptic Density Proteins Using a Discontinuous Sucrose Gradient

Published on: September 3, 2014

31.2K

Related Experiment Videos

Last Updated: Jun 5, 2025

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation
13:04

Experimental and Data Analysis Workflow for Soft Matter Nanoindentation

Published on: January 18, 2022

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

Deep Neural Networks for Image-Based Dietary Assessment

Published on: March 13, 2021

9.0K
Preparation of Synaptic Plasma Membrane and Postsynaptic Density Proteins Using a Discontinuous Sucrose Gradient
08:06

Preparation of Synaptic Plasma Membrane and Postsynaptic Density Proteins Using a Discontinuous Sucrose Gradient

Published on: September 3, 2014

31.2K

Area of Science:

  • Optimization Theory
  • Applied Mathematics
  • Convex Analysis

Background:

  • Primal subgradient methods are widely used for convex optimization.
  • Classical step-size rules often require adjustments for constrained problems.
  • Nonsmooth and constrained optimization present unique analytical challenges.

Purpose of the Study:

  • To develop a novel framework for analyzing primal subgradient methods in nonsmooth convex optimization.
  • To address limitations of classical step-size rules in constrained settings.
  • To enhance the efficiency of subgradient schemes for specific problem classes.

Main Methods:

  • Development of a new analytical framework for primal subgradient methods.
  • Modification of classical step-size rules for constrained optimization.
  • Application of modified methods to problems with functional constraints.
  • Analysis of primal-dual methods for unbounded feasible sets.

Main Results:

  • The proposed framework corrects classical step-size rules for constrained problems.
  • Modified rules significantly accelerate subgradient schemes for smooth and strongly convex functions.
  • The new methods facilitate solving problems with functional constraints and approximating Lagrange multipliers.
  • A primal-dual variant is effective even for unbounded feasible sets.

Conclusions:

  • The enhanced framework provides a robust analysis of primal subgradient methods.
  • Modified step-size rules offer significant performance improvements in constrained optimization.
  • The developed methods offer practical solutions for complex optimization problems, including those with functional constraints and unbounded domains.