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

Transformation of Plane Strain

Transformation of Plane Strain

When analyzing elongated structures like bars subjected to uniformly distributed loads, it is essential to understand the transformation of plane strain when coordinate axes are rotated. This transformation helps to assess how material deformation characteristics vary with orientation, which is crucial in materials science and structural engineering.
Under plane strain conditions, typical for members where one dimension significantly exceeds the others, deformations and resultant strains are...

Transformation of Plane Stress

Transformation of Plane Stress

Studying stress transformation is essential in understanding how stress components within a material, like a cube under plane stress, change with rotation. This change is analyzed by considering a prismatic element within the cube. As the element rotates, the stress components acting on it—both normal and shearing stresses—change in magnitude and orientation. This change is quantified using trigonometric functions of the rotation angle, relating the forces acting on the rotated element's faces...

Optimization Problems

Optimization Problems

Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...

Methods of Medium Optimization

Methods of Medium Optimization

Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...

Elevation of Intermediate Points on Vertical Curves

Elevation of Intermediate Points on Vertical Curves

Vertical curves are essential in roadway design because they provide smooth transitions between varying roadway grades. Designing vertical curves involves calculating intermediate elevations and identifying the curve's highest or lowest point, which is essential for optimal roadway performance.Intermediate elevations on a vertical curve are determined using the tangent offset method. This method considers the initial elevation at the start of the curve, the grades, and the curve's geometry. The...

Vertical Curve: Problem Solving

Vertical Curve: Problem Solving

Vertical curves provide the transition between two roadway grades, ensuring safety, comfort, and functionality. Calculating elevations at specific stations along the curve involves several systematic steps based on the curve's geometry and provided design parameters.The vertical curve is defined by its length, grades, Point of Vertical Intersection (P.V.I.) location, and P.V.I. elevation. The stations of the Point of Vertical Curvature (P.V.C.), where the curve begins, and the Point of Vertical...

You might also read

Related Articles

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

Sort by

Same author

A global optimization method for nonlinear bilevel programming problems.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2008

Same journal

Strategic Ability Updating in Concurrent Games by Coalitional Commitment.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2015

Same journal

Meta-Analysis of the First Facial Expression Recognition Challenge.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Adjustable model-based fusion method for multispectral and panchromatic images.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Face Feature Weighted Fusion Based on Fuzzy Membership Degree for Video Face Recognition.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

A New Adaptive Fast Cellular Automaton Neighborhood Detection and Rule Identification Algorithm.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

Same journal

Human-arm-and-hand-dynamic model with variability analyses for a stylus-based haptic interface.

IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society·2012

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 4, 2026

Designing CAD/CAM Surgical Guides for Maxillary Reconstruction Using an In-house Approach

Designing CAD/CAM Surgical Guides for Maxillary Reconstruction Using an In-house Approach

Published on: August 24, 2018

A Deep-Cutting-Plane Technique for Reverse Convex Optimization.

K Moshirvaziri, M A Amouzegar

IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : a Publication of the IEEE Systems, Man, and Cybernetics Society

|February 8, 2011

Summary

This summary is machine-generated.

This study introduces deep-cutting-plane techniques for reverse-convex programs, enhancing optimization efficiency. The novel method improves bounds iteratively, leading to faster convergence in complex problem-solving.

More Related Videos

Three-Dimensional Preoperative Virtual Planning in Derotational Proximal Femoral Osteotomy

Three-Dimensional Preoperative Virtual Planning in Derotational Proximal Femoral Osteotomy

Published on: February 17, 2023

Precision Measurements and Parametric Models of Vertebral Endplates

Precision Measurements and Parametric Models of Vertebral Endplates

Published on: September 17, 2019

Related Experiment Videos

Last Updated: Jun 4, 2026

Designing CAD/CAM Surgical Guides for Maxillary Reconstruction Using an In-house Approach

Designing CAD/CAM Surgical Guides for Maxillary Reconstruction Using an In-house Approach

Published on: August 24, 2018

Three-Dimensional Preoperative Virtual Planning in Derotational Proximal Femoral Osteotomy

Three-Dimensional Preoperative Virtual Planning in Derotational Proximal Femoral Osteotomy

Published on: February 17, 2023

Precision Measurements and Parametric Models of Vertebral Endplates

Precision Measurements and Parametric Models of Vertebral Endplates

Published on: September 17, 2019

Area of Science:

Optimization Theory
Applied Mathematics
Computational Science

Background:

Cutting-plane methods are effective for convex and combinatorial optimization.
Their application to non-convex optimization shows promise.
Deep cuts are crucial for efficiently reducing search domains.

Purpose of the Study:

Develop deep-cutting-plane techniques for reverse-convex programs.
Improve the efficiency of global solution search in optimization.
Provide a robust algorithm for complex optimization problems.

Main Methods:

Utilizing deep-cutting-plane techniques.
Iteratively updating and improving upper and lower bounds for optimal values.
Employing fathoming strategies for search domain subdivisions.

Main Results:

Demonstrated effectiveness of deep cuts in reverse-convex programming.
Algorithm successfully finds, updates, and improves bounds.
Termination achieved when bounds converge or subdivisions are fathomed.

Conclusions:

Deep-cutting-plane techniques offer a promising approach for reverse-convex optimization.
The developed algorithm provides computational efficiency.
Numerical results and an illustrative example validate the method's efficacy.