Search references for SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING. Phrases containing SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
See searches and references containing SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING!SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
Optimization algorithm
Sequential quadratic programming (SQP) is an iterative method for constrained nonlinear optimization, also known as Lagrange-Newton method. SQP methods
Sequential quadratic programming
Sequential_quadratic_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
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
Solving an optimization problem with a quadratic objective function
multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming. "Programming" in this
Quadratic_programming
Type of algorithm for constrained optimization
Other nonlinear programming algorithms: Sequential quadratic programming Successive linear programming Sequential linear-quadratic programming Interior point
Penalty_method
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
Mathematical optimization algorithm
methods include: Successive linear programming (SLP) Sequential quadratic programming (SQP) Sequential linear-quadratic programming (SLQP) Reduced gradient
Active-set_method
Algorithm for solving the quadratic programming problem from training SVMs
Sequential minimal optimization (SMO) is an algorithm for solving the quadratic programming (QP) problem that arises during the training of support-vector
Sequential minimal optimization
Sequential_minimal_optimization
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
Optimization problem in mathematics
,Pm are all zero, then the constraints are in fact linear and the problem is a quadratic program. A convex QCQP problem can be efficiently solved using
Quadratically constrained quadratic program
Quadratically_constrained_quadratic_program
Optimizing objective functions that have constrained variables
a nonlinear programming problem. If all the hard constraints are linear and some are inequalities, but the objective function is quadratic, the problem
Constrained_optimization
Class of algorithms for solving constrained optimization problems
problems.[citation needed] Sequential quadratic programming Sequential linear programming Sequential linear-quadratic programming Open source and non-free/commercial
Augmented_Lagrangian_method
Algorithms for solving convex optimization problems
nonlinear programming, but they were later abandoned due to the presence of more competitive methods for this class of problems (e.g. sequential quadratic programming)
Interior-point_method
Subfield of mathematical optimization
are all linear, but the objective may be a convex quadratic function. Second order cone programming are more general. Semidefinite programming are more
Convex_optimization
Optimization algorithm
solve a system of linear equations A x − b = 0 {\displaystyle \mathbf {A} \mathbf {x} -\mathbf {b} =0} reformulated as a quadratic minimization problem
Gradient_descent
Estimate of time taken for running an algorithm
shell sort). No general-purpose sorts run in linear time, but the change from quadratic to sub-quadratic is of great practical importance. An algorithm
Time_complexity
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
Algorithm for finding zeros of functions
Furthermore, for a root of multiplicity 1, the convergence is at least quadratic (see Rate of convergence) in some sufficiently small neighbourhood of
Newton's_method
Statistical optimization technique
Bayesian optimization is a sequential design strategy for global optimization of black-box functions, that does not assume any functional forms. It is
Bayesian_optimization
Method used in statistics, pattern recognition, and other fields
has been suggested, however, that linear discriminant analysis be used when covariances are equal, and that quadratic discriminant analysis may be used
Linear_discriminant_analysis
Study of mathematical algorithms for optimization problems
nonlinear programming or as generalization of linear or convex quadratic programming. Linear programming (LP), a type of convex programming, studies the
Mathematical_optimization
Computer programming method for hashing
Linear probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs
Linear_probing
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
Active Set algorithm Sequential Quadratic Programming (SQP) algorithm Knitro provides tools for solving optimization models (both linear and nonlinear) with
Artelys_Knitro
Computer compiler optimization technique
overhead, the used graph coloring algorithm having a quadratic cost. Owing to this feature, linear scan is the approach currently used in several JIT compilers
Register_allocation
Algorithm to smooth data points
For example, with a 9-point linear function (moving average) two thirds of the noise is removed and with a 9-point quadratic/cubic smoothing function only
Savitzky–Golay_filter
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
iterative methods that reduce to Newton's method, such as sequential quadratic programming, may also be considered quasi-Newton methods. Newton's method
Quasi-Newton_method
Algorithm that estimates unknowns from a series of measurements over time
In statistics and control theory, Kalman filtering (also known as linear quadratic estimation) is an algorithm that uses a series of measurements observed
Kalman_filter
Constrained least squares problem
lower bounds αi ≤ xi ≤ βi. The NNLS problem is equivalent to a quadratic programming problem a r g m i n x ≥ 0 ( 1 2 x T Q x + c T x ) , {\displaystyle
Non-negative_least_squares
Term in mathematical optimization
"Maximization by Quadratic Hill-Climbing". Econometrica. 34 (3): 541–551. doi:10.2307/1909768. JSTOR 1909768. Madsen, K. Methods for non-linear least squares
Trust_region
Set of methods for supervised statistical learning
problem is a quadratic function of the c i {\displaystyle c_{i}} subject to linear constraints, it is efficiently solvable by quadratic programming algorithms
Support_vector_machine
Unsolved problem in computer science
theorem-proving (now known to be co-NP-complete) could be solved in quadratic or linear time, and posited that if so, then the discovery of mathematical
P_versus_NP_problem
Optimization algorithm
machine parts for weight reduction, durability, and performance. Sequential quadratic programming Topology optimization Bendsøe, M. P., & Sigmund, O. (2003)
Method_of_moving_asymptotes
Optimization algorithm
Ant System for Quadratic Assignment Problems". CiteSeerX 10.1.1.47.5167. • Stützle, Thomas (July 1997). MAX-MIN Ant System for Quadratic Assignment Problems
Ant colony optimization algorithms
Ant_colony_optimization_algorithms
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
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
Sorting algorithm
sets, much like other quadratic (i.e., O(n2)) sorting algorithms May be more efficient in practice than most other simple quadratic algorithms such as selection
Insertion_sort
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
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
Fractal named after mathematician Benoit Mandelbrot
Mandelbrot first visualized the set. Mandelbrot studied the parameter space of quadratic polynomials in an article that appeared in 1980. The mathematical study
Mandelbrot_set
Optimization algorithm
non-degenerate local minimum (= with a positive second derivative), then it has quadratic convergence. Regula falsi is another method that fits the function to
Line_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
Numerical approximation algorithm
direct methods would deliver an exact solution (for example, solving a linear system of equations A x = b {\displaystyle A\mathbf {x} =\mathbf {b} } by
Iterative_method
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 method
convex target. However, some real-life applications (like Sequential Quadratic Programming methods) routinely produce negative or nearly-zero curvatures
Broyden–Fletcher–Goldfarb–Shanno algorithm
Broyden–Fletcher–Goldfarb–Shanno_algorithm
Optimization technique
optimization approaches, such as algorithms from mathematical programming, constraint programming, and machine learning. Both components of a hybrid metaheuristic
Metaheuristic
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
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
Matrix programming language
with GAUSS without extra cost): Qprog – Quadratic programming SqpSolvemt – Sequential quadratic programming QNewton - Quasi-Newton unconstrained optimization
GAUSS_(software)
Concept in mathematics
generalizes the conjugate gradient method to nonlinear optimization. For a quadratic function f ( x ) {\displaystyle \displaystyle f(x)} f ( x ) = ‖ A x −
Nonlinear conjugate gradient method
Nonlinear_conjugate_gradient_method
Successive linear programming (SLP) — replace problem by a linear programming problem, solve that, and repeat Sequential quadratic programming (SQP) — replace
List of numerical analysis topics
List_of_numerical_analysis_topics
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
Property of operations
idempotent. In a Tropical semiring, addition is idempotent. In a ring of quadratic matrices, the determinant of an idempotent matrix is either 0 or 1. If
Idempotence
derivatives are available, Newton's method is applicable and exhibits quadratic convergence. Alternating the parabolic iterations with a more robust method
Successive parabolic interpolation
Successive_parabolic_interpolation
Overview of and topical guide to statistics
optimization Linear programming Linear matrix inequality Quadratic programming Quadratically constrained quadratic program Second-order cone programming Semidefinite
Outline_of_statistics
Matrix decomposition method
twice as efficient. In linear least squares problem one seeks a solution x of an over-determined system Ax = l, such that quadratic norm of the residual
Cholesky_decomposition
Optimization by removing non-optimal solutions to subproblems
number of NP-hard problems: Integer programming Nonlinear programming Travelling salesman problem (TSP) Quadratic assignment problem (QAP) Maximum satisfiability
Branch_and_bound
for solving linear programming problems with special structure Delayed column generation Integer linear programming: solve linear programming problems where
List_of_algorithms
Overview of and topical guide to machine learning
Gaussian process regression Gene expression programming Group method of data handling (GMDH) Inductive logic programming Instance-based learning Lazy learning
Outline_of_machine_learning
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
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
Optimization algorithm
1016/0041-5553(66)90114-5. Frank, M.; Wolfe, P. (1956). "An algorithm for quadratic programming". Naval Research Logistics Quarterly. 3 (1–2): 95–110. doi:10.1002/nav
Frank–Wolfe_algorithm
Technique in computer vision
the global minimum. Each regional minimum is computed with sequential quadratic programming that is initiated at nearest orthogonal approximation matrices
Perspective-n-Point
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
Mapping function that preserves data point locality
geographical database. Areal data units are contained in one or a few quadratic frames represented by their sizes and lower right corner Z-values, the
Z-order_curve
Algorithm for modelling sequential data
unlike RNNs, they require computation time that is quadratic in the size of the context window. The linearly scaling fast weight controller (1992) learns to
Transformer_(deep_learning)
Study of strategic decision making
Caines (2009), a relatively simple model of large-scale games is the linear-quadratic Gaussian model. The individual agent's dynamics are modeled as a stochastic
Mean-field_game_theory
2017 research paper by Google
unlike RNNs, they require computation time that is quadratic in the size of the context window. The linearly scaling fast weight controller (1992) learns to
Attention_Is_All_You_Need
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
Technique for finding an extremum of a function
ratio. Ternary search Brent's method Binary search Kiefer, J. (1953), "Sequential minimax search for a maximum", Proceedings of the American Mathematical
Golden-section_search
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
Queuing theory in teletraffic engineering Quota sampling R programming language – see R (programming language) R v Adams (prob/stats related court case) Radar
List_of_statistics_articles
Algorithm for measuring similarity between temporal sequences
Toward Accurate Dynamic Time Warping in Linear Time and Space. KDD Workshop on Mining Temporal and Sequential Data, pp. 70–80, 2004. Meinard Müller, Henning
Dynamic_time_warping
Solving multiple machine learning tasks at the same time
developed concurrently across tasks, transfer of knowledge implies a sequentially shared representation. Large scale machine learning projects such as
Multi-task_learning
Java math library
Second Order Conic Programming SDP - Explanation of Semidefinite Programming SQP - Explanation of Sequential quadratic programming Interior Point Method
SuanShu_numerical_library
Sequence in computer science
García-Fernández, Ángel F. (2023). "Temporal Parallelisation of Dynamic Programming and Linear Quadratic Control". IEEE Transactions on Automatic Control. 68 (2): 851–866
Prefix_sum
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
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
Algorithm for supervised learning of binary classifiers
specific class. It is a type of linear classifier, i.e. a classification algorithm that makes its predictions based on a linear predictor function combining
Perceptron
Numerical optimization method
in Anderson's paper. A MATLAB code reproducing the sequential procedure for the general non-linear regression of an example mathematical model can be
Random_search
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
Algorithm that arranges lists in order
original elements) of the input. Although some algorithms are designed for sequential access, the highest-performing algorithms assume data is stored in a data
Sorting_algorithm
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Gradient_method
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
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
Divide and conquer sorting algorithm
1998, which consistently drives even his 1993 variant of Quicksort into quadratic behavior by producing adversarial data on-the-fly. Quicksort is a type
Quicksort
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
Experimental design that is optimal with respect to some statistical criterion
optimal designs of Kôno. The optimization of sequential experimentation is studied also in stochastic programming and in systems and control. Popular methods
Optimal_experimental_design
Population-based search algorithm
Differentiable Augmented Lagrangian methods Sequential quadratic programming Successive linear programming Convex optimization Convex minimization Cutting-plane
Bees_algorithm
Mathematical optimization theory
"Reliability Based Design Optimization", RBDO. Consider the following linear programming problem max x , y { 3 x + 2 y } s u b j e c t t o x ,
Robust_optimization
Topics referred to by the same term
Index of a linear map, the dimension of the map's kernel minus the dimension of its cokernel Index of a matrix Index of a real quadratic form Index,
Index
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
Algorithms for matrix decomposition
fusion and relational learning. NMF is an instance of nonnegative quadratic programming, just like the support vector machine (SVM). However, SVM and NMF
Non-negative matrix factorization
Non-negative_matrix_factorization
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
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
Greek electrical engineer (1942–2026)
algorithmic convergence issues around augmented Lagrangian and sequential quadratic programming methods. "Parallel and Distributed Computation: Numerical Methods"
Dimitri_Bertsekas
Peter J (2009). "Tableau-based protein substructure search using quadratic programming". BMC Bioinformatics. 10 (1): 153. doi:10.1186/1471-2105-10-153
Structural_alignment_software
Procedure for finding a stable matching
The algorithm can be implemented to run in time quadratic in the number of participants, and linear in the size of the input to the algorithm. The stable
Gale–Shapley_algorithm
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
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."
Male
Scandinavian
Scandinavian form of Old Norse Einarr, EINAR means "lone warrior."
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).
Surname or Lastname
English (Cornish)
English (Cornish) : habitational name from a place named with Cornish lan ‘church’. In England this surname is now found chiefly in the southern counties of Wiltshire and Hampshire, and Berkshire; it has no doubt moved there from Cornwall.
Male
Yiddish
 Variant spelling of Yiddish Lieber, LIBER means "beloved." Compare with another form of Liber.
Boy/Male
Hindu
Lingam
Surname or Lastname
English (Devon; of Cornish origin)
English (Devon; of Cornish origin) : topographic name for someone who lived by a menhir, i.e. a tall standing stone erected in prehistoric times (Cornish men ‘stone’ + hir ‘long’).
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.
Surname or Lastname
English
English : occupational name for a whitewasher, Middle English limer, lymer, an agent derivative of Old English līm ‘lime’.
Female
Scottish
Variant spelling of Scottish Lilias, LILEAS means "lily."
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.
Female
English
Variant spelling of English Linsey, LINSAY means "Lincoln's wetlands."
Male
English
Irish Anglicized form of Gaelic Fionnbarr, FINBAR means "fair-headed."
Boy/Male
Hindu
The Sun
Surname or Lastname
English
English : metronymic from Line.
Male
Greek
(ΑἰνÎας) Variant spelling of Greek AineÃas, AINEAS means "praiseworthy."
Surname or Lastname
Swedish
Swedish : ornamental name from lind ‘lime tree’ + either the German suffix -er denoting an inhabitant, or the surname suffix -ér, derived from the Latin adjectival ending -er(i)us.English (mainly southeastern) : variant of Lind 2.German : habitational name from any of numerous places called Linden or Lindern, named with German Linden ‘lime trees’.
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’.
Boy/Male
Sikh
Love unending
Surname or Lastname
English
English : variant of Lanier 1.Dutch : variant of Leonard.Jewish (western Ashkenazic) : name taken by someone who was good at chanting the Pentateuch at public worship in the synagogue or who regularly did so, from West Yiddish layner ‘reader’ (a derivative of West Yiddish laynen ‘to read’, which comes ultimately from Latin legere ‘to read’).Jewish (Ashkenazic) : occupational name for a flax grower or merchant, from German Lein ‘flax’ + agent suffix -er.
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
Boy/Male
American, Australian, British, Chinese, Christian, Danish, English, French, German, Greek, Hebrew, Indian, Irish, Italian, Latin, Portuguese, Swedish
Blessed; Happy
Girl/Female
American, British, English, Swedish
Female Version of Albert from the Old; Bright; Noble Famous; Bright Nobility
Boy/Male
French German American English
Renowned in the land. Roland was a legendary hero who served Charlemagne.
Boy/Male
American, Anglo, Australian, British, Christian, English, French, German
Will; Desire; Fortress; Dearly Loved Stronghold; Resolute; Brilliant; Wild Boar; Walled Stronghold
Boy/Male
American, British, English, Latin, Teutonic
Thunder Ruler
Girl/Female
Welsh
White.
Female
English
Variant spelling of English Tawny, TAWNEE means "light brown, tawny."
Boy/Male
Bengali, Gujarati, Hindu, Indian, Kannada, Marathi, Telugu
South West
Boy/Male
Arabic
Desire; Object
Girl/Female
Indian
Believer
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
SEQUENTIAL LINEAR-QUADRATIC-PROGRAMMING
a.
Linear.
imp. & p. p.
of Quadrate
adv.
In a linear manner; with lines.
p. pr. & vb. n.
of Quadrate
a.
The quadrate bone.
n.
A curve made use of in the quadrature of other curves; as the quadratrix, of Dinostratus, or of Tschirnhausen.
a.
Of or pertaining to a sentence, or full period; as, a sentential pause.
a.
In the direction of a line; of or pertaining to a line; measured on, or ascertained by, a line; linear; as, lineal magnitude.
a.
Composed of lines; delineated; as, lineal designs.
a.
Pertaining to terms of the second degree; as, a quadratic equation, in which the highest power of the unknown quantity is a square.
a.
Descending in a direct line from an ancestor; hereditary; derived from ancestors; -- opposed to collateral; as, a lineal descent or a lineal descendant.
a.
Of or pertaining to a line; consisting of lines; in a straight direction; lineal.
a.
Of or pertaining to a square, or to squares; resembling a quadrate, or square; square.
n.
A biquadratic equation.
a.
Of, pertaining to, or included by, two lines; as, bilinear coordinates.
a.
Comprising sentences; as, a sentential translation.
n.
That branch of algebra which treats of quadratic equations.
a.
Like a line; narrow; of the same breadth throughout, except at the extremities; as, a linear leaf.
a.
Of a linear shape.
n.
One who lines, as, a liner of shoes.