Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

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...

Propagation of Uncertainty from Random Error

Propagation of Uncertainty from Random Error

An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...

Stability of structures

Stability of structures

In mechanical engineering, the stability of systems under various forces is critical for designing durable and efficient structures. One fundamental way to explore these concepts is by analyzing systems like two rods connected at a pivot point, O, with a torsional spring of spring constant k at the pivot point. This system is similar in appearance to a scissor jack used to change tires on a car. In this case, the arms of the linkage (equivalent to the rods in this system) are entirely vertical,...

Survival Tree

Survival Tree

Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
Building a Survival Tree
Constructing a survival tree begins...

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...

Propagation of Uncertainty from Systematic Error

Propagation of Uncertainty from Systematic Error

The atomic mass of an element varies due to the relative ratio of its isotopes. A sample's relative proportion of oxygen isotopes influences its average atomic mass. For instance, if we were to measure the atomic mass of oxygen from a sample, the mass would be a weighted average of the isotopic masses of oxygen in that sample. Since a single sample is not likely to perfectly reflect the true atomic mass of oxygen for all the molecules of oxygen on Earth, the mass we obtain from this particular...

You might also read

Related Articles

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

Sort by

Same author

Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction.

Inverse problems·2013

Same author

Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections.

International transactions in operational research : a journal of The International Federation of Operational Research Societies·2012

Same author

Reconstruction from a Few Projections by ℓ(1)-Minimization of the Haar Transform.

Inverse problems·2011

Same author

Boundary detection in multidimensions.

IEEE transactions on pattern analysis and machine intelligence·2011

Same author

The Subgradient Extragradient Method for Solving Variational Inequalities in Hilbert Space.

Journal of optimization theory and applications·2011

Same author

Total variation superiorization schemes in proton computed tomography image reconstruction.

Medical physics·2010

Search research articles

Related Experiment Videos

Perturbation Resilience and Superiorization of Iterative Algorithms.

Y Censor¹, R Davidi, G T Herman

¹Department of Mathematics, University of Haifa, Mount Carmel, Haifa 31905, Israel.

Inverse Problems

|July 9, 2010

Summary

This summary is machine-generated.

This study introduces a method to enhance iterative algorithms for optimization problems. Superiorized versions retain computational efficiency while improving solutions for complex tasks like image reconstruction.

Related Experiment Videos

Area of Science:

Optimization algorithms
Computational mathematics
Image processing

Background:

Iterative algorithms efficiently solve problems like convex set intersection.
Optimization problems often require more computational resources.
Existing algorithms may not balance efficiency with optimization effectiveness.

Purpose of the Study:

To develop a methodology for creating "superiorized" versions of existing iterative algorithms.
To enhance computational efficiency for optimization tasks.
To address the limitations of standard iterative methods in solving complex optimization problems.

Main Methods:

Introduced a methodology to automatically generate "superiorized" iterative algorithms.
Demonstrated that "perturbation resilient" algorithms, like projection algorithms for convex feasibility, can be superiorized.
Applied superiorization using perturbations to guide algorithms towards improved feasible points.

Main Results:

Superiorized algorithms maintain computational efficiency while advancing optimization goals.
Projection algorithms for consistent convex feasibility problems were shown to be "perturbation resilient".
Demonstrated superiorized algorithms in image reconstruction using total variation as the objective function.

Conclusions:

The presented methodology effectively creates computationally efficient "superiorized" algorithms for optimization.
Superiorization offers a viable approach to enhance iterative methods for problems with limited computational resources.
The technique shows promise in practical applications such as image reconstruction from projections.