AI & ChatGPT searches , social queriess for SUCCESSIVE LINEAR-PROGRAMMING
Search references for SUCCESSIVE LINEAR-PROGRAMMING. Phrases containing SUCCESSIVE LINEAR-PROGRAMMING
See searches and references containing SUCCESSIVE LINEAR-PROGRAMMING!
Search references for SUCCESSIVE LINEAR-PROGRAMMING. Phrases containing SUCCESSIVE LINEAR-PROGRAMMING
See searches and references containing SUCCESSIVE LINEAR-PROGRAMMING!SUCCESSIVE LINEAR-PROGRAMMING
Approximation for nonlinear optimization
Successive Linear Programming (SLP), also known as Sequential Linear Programming, is an optimization technique for approximately solving nonlinear optimization
Successive_linear_programming
Method to solve optimization problems
and objective are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization)
Linear_programming
Mathematical optimization problem restricted to integers
integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is
Integer_programming
Solution process for some optimization problems
minimization Linear programming nl (format) Nonlinear least squares List of optimization software Quadratically constrained quadratic programming Werner Fenchel
Nonlinear_programming
Solving an optimization problem with a quadratic objective function
function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming. "Programming" in this context refers
Quadratic_programming
Numerical approximation algorithm
Linear stationary iterative methods are also called relaxation methods. Krylov subspace methods work by forming a basis of the sequence of successive
Iterative_method
Problem optimization method
logistics. This usage is the same as that in the phrases linear programming and mathematical programming, a synonym for mathematical optimization. The above
Dynamic_programming
Optimization algorithm
in a diverse range of SQP methods. Sequential linear programming Sequential linear-quadratic programming Augmented Lagrangian method SQP methods have been
Sequential quadratic programming
Sequential_quadratic_programming
Optimization technique for solving (mixed) integer linear programs
by solving a non-integer linear program, the linear relaxation of the given integer program. The theory of Linear Programming dictates that under mild
Cutting-plane_method
Class of algorithms for solving constrained optimization problems
[citation needed] Sequential quadratic programming Sequential linear programming Sequential linear-quadratic programming Open source and non-free/commercial
Augmented_Lagrangian_method
Subfield of mathematical optimization
transformations: Linear programming problems are the simplest convex programs. In LP, the objective and constraint functions are all linear. Quadratic programming are
Convex_optimization
Type of algorithm for constrained optimization
Other nonlinear programming algorithms: Sequential quadratic programming Successive linear programming Sequential linear-quadratic programming Interior point
Penalty_method
Algorithm used to solve non-linear least squares problems
also known as the damped least-squares (DLS) method, is used to solve non-linear least squares problems. These minimization problems arise especially in
Levenberg–Marquardt_algorithm
Optimization algorithm
feasible set is given by a set of linear constraints, then the subproblem to be solved in each iteration becomes a linear program. While the worst-case convergence
Frank–Wolfe_algorithm
Optimization by removing non-optimal solutions to subproblems
1016/0004-3702(84)90004-3. LiPS – Free easy-to-use GUI program intended for solving linear, integer and goal programming problems. Cbc – (Coin-or branch and cut) is
Branch_and_bound
Algorithms for solving convex optimization problems
the mid-1980s. In 1984, Narendra Karmarkar developed a method for linear programming called Karmarkar's algorithm, which runs in polynomial time ( O (
Interior-point_method
Optimization algorithm
independently proposed a similar method in 1907. Its convergence properties for non-linear optimization problems were first studied by Haskell Curry in 1944, with
Gradient_descent
Optimization algorithm
vectors that represent the approximation implicitly. Due to its resulting linear memory requirement, the L-BFGS method is particularly well suited for optimization
Limited-memory_BFGS
Class of algorithms that find approximate solutions to optimization problems
appropriate mathematical programming formulation (typically a convex programming) such as Linear programming, Semidefinite programming, etc, to obtain a relaxation
Approximation_algorithm
Numerical optimization algorithm
Methods: Linear Algebra and Function Minimisation. Bristol: Adam Hilger. ISBN 978-0-85274-330-0. Avriel, Mordecai (2003). Nonlinear Programming: Analysis
Nelder–Mead_method
Subfield of mathematical optimization
optimization. A considerable amount of it is unified by the theory of linear programming. Some examples of combinatorial optimization problems that are covered
Combinatorial_optimization
Optimizing objective functions that have constrained variables
of the hard constraints are linear and some hard constraints are inequalities, then the problem is a linear programming problem. This can be solved by
Constrained_optimization
Study of mathematical algorithms for optimization problems
mathematical programming problem (a term not directly related to computer programming, but still in use for example in linear programming – see History
Mathematical_optimization
Optimization algorithm
methods that reduce to Newton's method, such as sequential quadratic programming, may also be considered quasi-Newton methods. Newton's method to find
Quasi-Newton_method
Optimization method
ISBN 978-0-471-91547-8 Luenberger, David G.; Ye, Yinyu (2008), Linear and nonlinear programming, International Series in Operations Research & Management Science
Broyden–Fletcher–Goldfarb–Shanno algorithm
Broyden–Fletcher–Goldfarb–Shanno_algorithm
Statistical optimization technique
visual attention, architecture configuration in deep learning, static program analysis, experimental particle physics, quality-diversity optimization
Bayesian_optimization
Sequence of locally optimal choices
of a dynamic programming algorithm. Uriel Feige notes that: [Greedy algorithms] may be viewed as the ultimate form of dynamic programming, in which only
Greedy_algorithm
only linear convergence (such as line search). Moreover, not requiring the computation or approximation of function derivatives makes successive parabolic
Successive parabolic interpolation
Successive_parabolic_interpolation
Mathematical algorithm
Coordinate descent is an optimization algorithm that successively minimizes along coordinate directions to find the minimum of a function. At each iteration
Coordinate_descent
Suite of mathematical modeling and optimization tools
commercial optimization solver for linear programming (LP), mixed integer linear programming (MILP), convex quadratic programming (QP), convex quadratically constrained
FICO_Xpress
Combinatorial optimization method
of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some or all the unknowns are
Branch_and_cut
Mathematical algorithm for eliminating variables from a system of linear inequalities
Fourier–Motzkin elimination and complexity estimates are given in. Linear programming is well known to give solutions to inequality systems in polynomial
Fourier–Motzkin_elimination
Optimization algorithm
need two function evaluations per iteration. Therefore, the method has linear convergence with rate 0.5 ≈ 0.71 {\displaystyle {\sqrt {0.5}}\approx 0.71}
Line_search
Method of solving linear programming problems
In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm. The Big M method extends the simplex
Big_M_method
Optimization algorithm
2480611. ISBN 978-1-4503-1656-9. S2CID 1216890. L. Wang and Q. D. Wu, "Linear system parameters identification based on ant system algorithm," Proceedings
Ant colony optimization algorithms
Ant_colony_optimization_algorithms
Algorithm for finding zeros of functions
Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real-valued function
Newton's_method
Computer compiler optimization technique
offline stage, an optimal spill set is first gathered using Integer Linear Programming. Then, live ranges are annotated using the compressAnnotation algorithm
Register_allocation
Form of Newton's method used in statistics
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Scoring_algorithm
Algorithm for solving the quadratic programming problem from training SVMs
methods or row-action methods. These methods solve convex programming problems with linear constraints. They are iterative methods where each step projects
Sequential minimal optimization
Sequential_minimal_optimization
Algorithm for linear programming
Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex
Simplex_algorithm
Optimization algorithm
convex problems by hill-climbing include the simplex algorithm for linear programming and binary search. To attempt to avoid getting stuck in local optima
Hill_climbing
Subfield of convex optimization
Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified
Semidefinite_programming
Sequential linear-quadratic programming (SLQP) is an iterative method for nonlinear optimization problems where objective function and constraints are
Sequential linear-quadratic programming
Sequential_linear-quadratic_programming
Inequalities for inexact line search
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Wolfe_conditions
Algorithm in computer science
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Artificial bee colony algorithm
Artificial_bee_colony_algorithm
Primal-Dual algorithm optimization for convex problems
algorithm in PyTorch for GPU-accelerated linear programming in his Primal-Dual Algorithm for Linear Programming GitHub Repository The Manopt.jl package
Chambolle–Pock_algorithm
Local search algorithm
in common with tabu search, and is often employed in solving large non-linear optimization problems. The following pseudocode presents a simplified version
Tabu_search
Quantum physics-based metaheuristic for optimization problems
doi:10.1038/nature10012. PMID 21562559. S2CID 205224761. "Learning to program the D-Wave One". D-Wave Systems blog. Archived from the original on July
Quantum_annealing
Mathematical combinatorial optimization method
combinatorial optimization for solving integer linear programming (ILP) and mixed integer linear programming (MILP) problems with many variables. The method
Branch_and_price
Algorithm for solving linear programs
successfully used is the cutting stock problem. One particular technique in linear programming which uses this kind of approach is the Dantzig–Wolfe decomposition
Column_generation
Population-based search algorithm
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Bees_algorithm
Special case of discrete optimization
to model non-linear functions of a variable in a linear model. They are the natural extension of the concepts of Separable Programming, but when embedded
Special_ordered_set
Methods in numerical computation
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Rosenbrock_methods
Optimization technique
optimization approaches, such as algorithms from mathematical programming, constraint programming, and machine learning. Both components of a hybrid metaheuristic
Metaheuristic
Iterative method for minimizing convex functions
Nemirovski and David B. Yudin (Judin). As an algorithm for solving linear programming problems with rational data, the ellipsoid algorithm was studied by
Ellipsoid_method
Topics referred to by the same term
a service discovery protocol Straight-line program, in computational algebra Successive linear programming System Locked Pre-installation St. Louis Park
SLP
Algorithm for computing the maximal flow of a network
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Dinic's_algorithm
Algorithm to compute the maximum flow in a flow network
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Edmonds–Karp_algorithm
Iterative optimisation algorithm
method, is an iterative optimisation algorithm for the solution of non-linear least squares problems, introduced in 1970 by Michael J. D. Powell. Similarly
Powell's_dog_leg_method
Concept in mathematics
{\displaystyle \nabla _{x}f=2A^{T}(Ax-b)=0} . Whereas linear conjugate gradient seeks a solution to the linear equation A T A x = A T b {\displaystyle \displaystyle
Nonlinear conjugate gradient method
Nonlinear_conjugate_gradient_method
Concept in mathematics
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Mirror_descent
Linear programming algorithm
an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves
Karmarkar's_algorithm
Concept in convex optimization mathematics
14(a) in Bertsekas (page 636): Bertsekas, Dimitri P. (1999). Nonlinear Programming (Second ed.). Cambridge, MA.: Athena Scientific. ISBN 1-886529-00-0.
Subgradient_method
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Meta-optimization
Technique for finding an extremum of a function
interval, it will converge to that boundary point. The method operates by successively narrowing the range of values on the specified interval, which makes
Golden-section_search
Linear programming algorithm
simplex method is a variant of George Dantzig's simplex method for linear programming. The revised simplex method is mathematically equivalent to the standard
Revised_simplex_method
ISBN 0-12-192350-9. MR 1150683. Murty, K. G. (1988). Linear complementarity, linear and nonlinear programming. Sigma Series in Applied Mathematics. Vol. 3. Berlin:
Lemke's_algorithm
Collective behavior of decentralized, self-organized systems
organisms in synthetic collective intelligence. Boids is an artificial life program, developed by Craig Reynolds in 1986, which simulates flocking. It was
Swarm_intelligence
Optimization algorithm
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Cuckoo_search
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Evolutionary multimodal optimization
Evolutionary_multimodal_optimization
Algorithm for solving linear programming problems
mathematical optimization, affine scaling is an algorithm for solving linear programming problems. Specifically, it is an interior point method, discovered
Affine_scaling
Term in mathematical optimization
function is iteratively approximated by a quadratic surface, then using a linear solver, the estimate is updated. This alone may not converge nicely if the
Trust_region
Mathematical optimization algorithms
optimization, are a family of optimization algorithms designed for optimizing non-linear functions with large numbers of independent variables. A truncated Newton
Truncated_Newton_method
Algorithm for finding a local minimum of a function
The new position ( x 1 {\textstyle x_{1}} ) can then be expressed as a linear combination of the search vectors i.e. x 1 = x 0 + ∑ i = 1 N α i s i {\textstyle
Powell's_method
Optimization algorithm
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Spiral_optimization_algorithm
metaheuristic algorithms including the bat algorithm is given by Yang where a demo program in MATLAB/GNU Octave is available, while a comprehensive review is carried
Bat_algorithm
Metaheuristic proposed by Xin-She Yang
lk/bitstream/handle/345/1038/com-047.pdf?sequence=1&isAllowed=y [1] Files of the Matlab programs included in the book: Xin-She Yang, Nature-Inspired Metaheuristic Algorithms
Firefly_algorithm
Solving multiple machine learning tasks at the same time
more formally below, that the parameter vector modeling each task is a linear combination of some underlying basis. Similarity in terms of this basis
Multi-task_learning
Branch of mathematical optimization
on graphs, matroids and other discrete structures integer programming constraint programming These branches are all closely intertwined however, since
Discrete_optimization
Continuous function whose value increases to infinity
Springer. p. 566. ISBN 0-387-30303-0. Vanderbei, Robert J. (2001). Linear Programming: Foundations and Extensions. Kluwer. pp. 277–279. Lecture 14: Barrier
Barrier_function
optimisation, has also been implemented in the Computer-Aided Constraint Programming project. Alsheddy (2011) extended guided local search to multi-objective
Guided_local_search
Unit hypercube of variable dimension whose corners have been perturbed
expected number of steps is proportional to D {\displaystyle D} for linear-programming problems that are randomly drawn from the Euclidean unit sphere, as
Klee–Minty_cube
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Berndt–Hall–Hall–Hausman algorithm
Berndt–Hall–Hall–Hausman_algorithm
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Gradient_method
problems Successive linear programming (SLP) — replace problem by a linear programming problem, solve that, and repeat Sequential quadratic programming (SQP)
List of numerical analysis topics
List_of_numerical_analysis_topics
Algorithm in mathematical optimization
implementing push-relabel method for the maximum flow problem". Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Vol
Push–relabel maximum flow algorithm
Push–relabel_maximum_flow_algorithm
Faltings, Boi (2006), "Distributed Constraint Programming", in Walsh, Toby (ed.), Handbook of Constraint Programming, Elsevier, ISBN 978-0-444-52726-4 A chapter
Distributed constraint optimization
Distributed_constraint_optimization
Optimization method
Compact quasi-Newton representation Avriel, Mordecai (1976). Nonlinear Programming: Analysis and Methods. Prentice-Hall. pp. 352–353. ISBN 0-13-623603-0
Davidon–Fletcher–Powell formula
Davidon–Fletcher–Powell_formula
of the limited-memory matrix, the trust-region L-SR1 algorithm scales linearly with the problem size, just like L-BFGS. Quasi-Newton method Broyden's
Symmetric_rank-one
Mathematical optimization algorithm
methods include: Successive linear programming (SLP) Sequential quadratic programming (SQP) Sequential linear-quadratic programming (SLQP) Reduced gradient
Active-set_method
Type of optimization heuristic
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Extremal_optimization
Algorithm for generating pseudo-randomized numbers
A linear congruential generator (LCG) is an algorithm that yields a sequence of pseudo-randomized numbers calculated with a discontinuous piecewise linear
Linear_congruential_generator
Method of solving a linear system of equations
In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method for solving a linear system of equations
Successive_over-relaxation
Crucial concept of quantum information
H ) {\displaystyle {\mathcal {B}}(\mathbb {H} )} is the set of bounded linear operators on a Hilbert space H {\displaystyle \mathbb {H} } . Then M 1
Incompatibility of quantum measurements
Incompatibility_of_quantum_measurements
Method for mathematical optimization
there are criss-cross algorithms for linear-fractional programming problems, quadratic-programming problems, and linear complementarity problems. Like the
Criss-cross_algorithm
migration frequency (number of steps in every subpopulation between two successive exchanges), and the selection/replacement of the migrants. In the case
Parallel_metaheuristic
Chinese scientist and revolutionary (born 1961)
of Protected Lightpaths in Optical Networks". Research Gate. Retrieved 11 July 2016. Quatratic.com — A website solver for Convex Nonlinear Programming
Liu_Gang
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Fireworks_algorithm
Type of electrical grid
Monitoring & Control (VSMC) software uses a sensitivity-based successive linear programming method to reliably determine the optimal control solution. IntelliGrid –
Smart_grid
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Great_deluge_algorithm
SUCCESSIVE LINEAR-PROGRAMMING
SUCCESSIVE LINEAR-PROGRAMMING
Male
Scandinavian
Scandinavian form of Old Norse Einarr, EINAR means "lone warrior."
Boy/Male
Irish
Meaning “â€fair-haired,â€â€ the name has been popular since the sixth century when St. Finbar came to an area of Cork that was being tormented by a serpent. The people begged him to do something to help them. One night he went to where the serpent was sleeping and sprinkled it with holy water. The angry serpent tore and devoured the land until she slithered into the sea at Cork Harbor. The track she left behind filled with water and became the River Lee and that’s why St. Finbar is the patron saint of Cork. It is said that the sun didn’t set for two weeks after Finbar’s death.
Female
English
Variant spelling of English Linsey, LINSAY means "Lincoln's wetlands."
Male
Greek
(ΑἰνÎας) Variant spelling of Greek AineÃas, AINEAS means "praiseworthy."
Boy/Male
Hindu
Lingam
Surname or Lastname
English
English : metronymic from Line.
Girl/Female
Hindu
Succession, Repetition
Boy/Male
Biblical
Ravisher, succession of miracles'.
Biblical
ravishers; succession of miracles
Boy/Male
Biblical
Order, succession, mountainous.
Male
English
Irish Anglicized form of Gaelic Fionnbarr, FINBAR means "fair-headed."
Surname or Lastname
English
English : variant of Lingard.French : occupational name for a maker of or dealer in linen goods, from Old French linge ‘linen (goods)’ (see Linge 1).
Female
English
English name probably derived from Germanic lindi, LINDA means "serpent."Â In some cases, it may have been derived from the Spanish word for "pretty."
Female
Scottish
Variant spelling of Scottish Lilias, LILEAS means "lily."
Surname or Lastname
English
English : occupational name for a whitewasher, Middle English limer, lymer, an agent derivative of Old English līm ‘lime’.
Surname or Lastname
English
English : habitational name from Lingart, Lancashire, or Lingards Wood in Marsden, West Yorkshire, both named from Old English līn ‘flax’ + garðr ‘enclosure’.
Biblical
order; succession; mountainous
Girl/Female
Irish
Eimear possessed the “Six Gifts of Womanhood†– “beauty, a gentle voice, sweet words, wisdom, needlework and chastity!†She was bethrothed to the warrior Cuchulainn (read the legend) when they were children and they loved each other very deeply. But Cuchulainn had “a wandering eye†and Eimear endured this, realizing “everything new is fair,†but when he made love to Fand, wife of the sea god Manannan, Eimear confronted the lovers. After seeing the strength of Fand’s love she offered to withdraw. Touched by this display of unselfishness, Fand left Cuchulainn and returned to the sea. When Cuchulainn died Eimear spoke movingly and lovingly at his graveside.
Girl/Female
Tamil
Succession, Repetition
Male
Yiddish
 Variant spelling of Yiddish Lieber, LIBER means "beloved." Compare with another form of Liber.
SUCCESSIVE LINEAR-PROGRAMMING
SUCCESSIVE LINEAR-PROGRAMMING
Girl/Female
Christian & English(British/American/Australian)
Great
Girl/Female
Bengali, Gujarati, Hindu, Indian, Jain, Kannada, Malayalam, Marathi, Sanskrit, Telugu
Great Personality; Wealth; Goddess Laxmi
Girl/Female
Indian, Telugu
Glow
Boy/Male
British, English
Royal Ruler
Boy/Male
Danish, German, Hebrew
Friend of the People; Exile; Voyager; Diminutive of Arvin
Boy/Male
Hindu, Indian, Punjabi, Telugu, Thai
A Desire
Boy/Male
Indian, Sanskrit
With the Moon as his Banner
Boy/Male
Arabic, Muslim, Pashtun, Sindhi
Respect; Dignity; Sobriety; Majesty
Girl/Female
Tamil
Priyanshi | பà¯à®°à®¿à®¯à®¾à®‚ஷீÂ
Lovable, Dear, Loving
Girl/Female
Scandinavian
Abbreviation of Katherine. Pure.
SUCCESSIVE LINEAR-PROGRAMMING
SUCCESSIVE LINEAR-PROGRAMMING
SUCCESSIVE LINEAR-PROGRAMMING
SUCCESSIVE LINEAR-PROGRAMMING
SUCCESSIVE LINEAR-PROGRAMMING
a.
Having or giving the right of succeeding to an inheritance; inherited by succession; hereditary; as, a successive title; a successive empire.
a.
Following in order or in uninterrupted course; coming after without interruption or interval; following one after another in a line or series; consecutive; as, the successive revolution of years; the successive kings of Egypt; successive strokes of a hammer.
a.
Descending in a direct line from an ancestor; hereditary; derived from ancestors; -- opposed to collateral; as, a lineal descent or a lineal descendant.
adv.
In a successive manner.
n.
One who lines, as, a liner of shoes.
a.
In the direction of a line; of or pertaining to a line; measured on, or ascertained by, a line; linear; as, lineal magnitude.
adv.
In a linear manner; with lines.
n.
A series or succession of ancestors or descendants of a given person; a family or race; as, the ascending or descending line; the line of descent; the male line; a line of kings.
n.
One who adjusts things to a line or lines or brings them into line.
v. t.
To mark with a line or lines; to cover with lines; as, to line a copy book.
a.
Composed of lines; delineated; as, lineal designs.
n.
A series of persons or things according to some established rule of precedence; as, a succession of kings, or of bishops; a succession of events in chronology.
a.
Of a linear shape.
a.
Characterized by a shaking motion, especially an up and down movement, and not merely tremulous oscillation; as, the succussive motion in earthquakes.
a.
Of or pertaining to a line; consisting of lines; in a straight direction; lineal.
a.
Like a line; narrow; of the same breadth throughout, except at the extremities; as, a linear leaf.
a.
Of, pertaining to, or included by, two lines; as, bilinear coordinates.
n.
An order or series of descendants; lineage; race; descent.
n.
The act of succeeding, or following after; a following of things in order of time or place, or a series of things so following; sequence; as, a succession of good crops; a succession of disasters.
a.
Linear.