Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Affine scaling

In mathematical optimization, affine scaling is an algorithm for solving linear programming problems. Specifically, it is an interior point method… Expand
Wikipedia

Related topics

Related topics

11 relations
AlgorithmChaos theoryDuality (optimization)Feasible region
Expand

Broader (1)

Linear programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Affine extractors over prime fields
An affine extractor is a map that is balanced on every affine subspace of large enough dimension. We construct an explicit affine… Expand
2011
2011
Improved Constructions of Three Source Extractors
  • X. Li
  • IEEE 26th Annual Conference on Computational…
  • 2011
    • Corpus ID: 11755443
We study the problem of constructing extractors for independent weak random sources. The probabilistic method shows that there… Expand
  • table I
Highly Cited
2009
Highly Cited
2009
Approximate explicit MPC using bilevel optimization
A linear quadratic model predictive controller (MPC) can be written as a parametric quadratic optimization problem whose solution… Expand
  • figure 1
2008
2008
Affine Registration of Point Sets Using ICP and ICA
This letter proposes a novel algorithm for affine registration of point sets in the way of incorporating an affine transformation… Expand
  • figure 1
  • table I
  • table II
  • figure 2
Highly Cited
2007
Highly Cited
2007
Optimal Step Nonrigid ICP Algorithms for Surface Registration
We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1999
Highly Cited
1999
An affine scaling methodology for best basis selection
A methodology is developed to derive algorithms for optimal basis selection by minimizing diversity measures proposed by… Expand
  • figure 1
  • table II
  • figure 2
  • table I
  • figure 3
Highly Cited
1999
Highly Cited
1999
Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
Abstract.A class of affine-scaling interior-point methods for bound constrained optimization problems is introduced which are… Expand
  • table 1
Highly Cited
1992
Highly Cited
1992
On affine scaling algorithms for nonconvex quadratic programming
  • Y. Ye
  • Math. Program.
  • 1992
    • Corpus ID: 206798229
We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or… Expand
Highly Cited
1991
Highly Cited
1991
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
We consider the continuous trajectories of the vector field induced by the primal affine scaling algorithm as applied to linear… Expand
Highly Cited
1989
Highly Cited
1989
The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories
Disclosed herein is an improved process for the preparation of known hypoglycemic piperidinesulfamylureas of the structure OO… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE