The mathematics of nonlinear programming
convex analysisKarush-Kuhn-Tucker theoryLagrange multipliersleast squaresoptimality conditionspenalty functions
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Numerical methods based on nonlinear programming (49M37) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Nonlinear programming (90C30)
The book is aimed at readers who have a working knowledge of linear algebra and basic calculus. It starts with classical optimization notions from calculus and proceeds smoothly to a study of convex functions. This is followed by material on basic numerical methods, least squares, Karush-Kuhn-Tucker theory, penalty functions and Lagrange multipliers. The authors do not attempt to be encyclopedic, but such classical techniques as Newton's Method and the Method of Steepest Descent as well as the more modern approaches of Broyden's Method, the Davidson-Fletcher- Powell Method, the Broyden-Fletcher-Goldfarb-Shanno Method and the duality theory of Geometric Programming are considered in some detail. There are many carefully chosen exercises and examples which illustrate the developed theory. This supplies an unexperienced reader, with modest backgrounds in formal mathematics, by means of gaining an understanding of the essential content without studying all the proofs in detail. The book provides a useful addition to the existing literature and can be used as a basis for an undergraduate course in nonlinear programming.
- Nonlinear programming, theory and algorithms
- scientific article; zbMATH DE number 3898606
- scientific article; zbMATH DE number 3970538
- scientific article; zbMATH DE number 722177
- scientific article; zbMATH DE number 1260459
- scientific article; zbMATH DE number 1206370
- scientific article; zbMATH DE number 1163812
- Nonlinear programming
- scientific article; zbMATH DE number 3308846
- Nonlinear problems in mathematical programming and optimal control
- Embeddings of bornological universes
- Exact penalty functions method for mathematical programming problems involving invex functions
- Accelerating convergence in the Fermat-Weber location problem
- Using modeling knowledge to guide design space search
- Approximating the permanent via importance sampling with application to the dimer covering problem
- Optimal joint pricing and lot sizing with fixed and variable capacity
- Partitioning under the \(L_p\) norm
- Insurer's optimal reinsurance strategies
- Remarks on compound Poisson approximation of Gaussian random sequences
- Evolutionary matrix games and optimization theory
- Normal and mixed partial second-order subdifferentials in variational analysis and optimization
- Controller-jammer game models of denial of service in control systems operating over packet-dropping links
- Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Geometric linear discriminant analysis for pattern recognition
- Teaching students nonlinear programming with computer algebra system
- Nonuniqueness versus uniqueness of optimal policies in convex discounted Markov decision processes
- A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
- MM algorithms for geometric and signomial programming
- Proximal gradient methods for general smooth graph total variation model in unsupervised learning
- On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
- An unbounded Berge's minimum theorem with applications to discounted Markov decision processes
- The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
- scientific article; zbMATH DE number 3854806 (Why is no real title available?)
- Algorithmic mathematics
- Mathematical Programming Problems Governed by Nonlinear Elliptic PDEs
- On solving a special class of weakly nonlinear finite-difference systems
- Gradient-only approaches to avoid spurious local minima in unconstrained optimization
- Regular graphs with maximal energy per vertex
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
- scientific article; zbMATH DE number 4128670 (Why is no real title available?)
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- On asymptotics of multivariate integrals with applications to records
- Minimization of quasi-convex symmetric and of discretely quasi-convex symmetric functions
- Nonlinear programming, theory and algorithms
- Path following in the exact penalty method of convex programming
- Nonlinear Optimization
- Sublinear-time quadratic minimization via spectral decomposition of matrices
- Das metrische Bernoulli-Prinzip als vereinfachtes Entscheidungsmodell
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Automated parameter selection in the ${L}^{1} \mbox{-} {L}^{2}$-TV model for removing Gaussian plus impulse noise
- scientific article; zbMATH DE number 960796 (Why is no real title available?)
- Non-isothermal viscoelastic flows with conservation laws and relaxation
- A contextualized historical analysis of the Kuhn-Tucker theorem in nonlinear programming: The impact of World War II
- Quadratic expansions of spectral functions
- Interval optimization problems for financial investment and its real-world applications
- Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
- Weighted sparsity regularization for source identification for elliptic PDEs
- Solving invex multitime control problems with first‐order PDE constraints via the absolute value exact penalty method
- A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition
- Assessment of methods for computing the closest point projection, penetration, and gap functions in contact searching problems
- Optimal design of multi-server Markovian queues with polynomial waiting and service costs
- Fuzzy rule base simplification using multidimensional scaling and constrained optimization
- On the Weierstrass theorem on extrema and its application for finding fixed points and zeros of mappings
- Scalarized utility-based multi-asset risk measures
- The sagitta method for solving linear programs
- A quadratic time algorithm for computing the optimal landing times of a fixed sequence of planes
- A new vector exponential exact penalty approach for solving nonsmooth vector optimization problems
- An efficient memory gradient method for extreme M-eigenvalues of elastic type tensors
- Optimality conditions and penalty function method for nonsmooth optimization problems with interval-valued objective functions
- Non-asymptotic confidence bounds for stochastic approximation algorithms with constant step size
- Towards a general theory of topological maps
- Optimal reinsurance under general risk measures
- Designing Bézier surfaces minimizing the \(L^2\)-norm of the Gaussian curvature
- Penalty function methods and a duality gap for invex optimization problems
- Comments on ``Dual methods for nonconvex spectrum optimization of multicarrier systems
- An alternating iterative method and its application in statistical inference
- Transforms of pseudo-Boolean random variables
This page was built for publication: The mathematics of nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3994363)