Related Experiment Video
Updated: Nov 1, 2025

Asymmetric Walkway: A Novel Behavioral Assay for Studying Asymmetric Locomotion
Published on: January 15, 2016
A Full Nesterov-Todd Step Infeasible Interior-point Method for Symmetric Optimization in the Wider Neighborhood of
Abstract:
In this paper, an improved Interior-Point Method (IPM) for solving symmetric optimization problems is presented. Symmetric optimization (SO) problems are linear optimization problems over symmetric cones. In particular, the method can be efficiently applied to an important instance of SO, a Controlled Tabular Adjustment (CTA) problem which is a method used for Statistical Disclosure Limitation (SDL) of tabular data. The presented method is a full Nesterov-Todd step infeasible IPM for SO. The algorithm converges to ε-approximate solution from any starting point whether feasible or infeasible. Each iteration consists of the feasibility step and several centering steps, however, the iterates are obtained in the wider neighborhood of the central path in comparison to the similar algorithms of this type which is the main improvement of the method. However, the currently best known iteration bound known for infeasible short-step methods is still achieved.
Related Concept Videos
Statically Indeterminate Problem Solving
Principle of Moments: Problem Solving
One such scenario involves a pole placed in a three-dimensional system with a cable attached. When a tension is applied to the cable, the moment about the z-axis passing through...
Gaussian Elimination: Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Application of Nonlinear Inequalities
Centroid of a Body: Problem Solving
The x-coordinates and y-coordinates of each element's...

