Live briefing
Everything about Active-set method
Mathematical optimization algorithm
In mathematical optimization, the active-set method is an algorithm used to identify the active constraints in a set of inequality constraints. The active constraints are then expressed as equality constraints, thereby transforming an inequality-constrained problem into a simpler equality-constrained subproblem. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Active-set methodA 5-minute orientation
- Skim a recent paper: Conformal topology optimization of multi-material ferromagnetic soft active structures using an extended level set methodInfluential work since 2022
- Pick up a classic book: The Art of Public SpeakingThe most-reprinted book on the subject
- Read the landmark paper: The Primal-Dual Active Set Strategy as a Semismooth Newton MethodCited 795 times
- Go sideways: Convex optimizationA closely related topic
- Go sideways: Nonlinear programmingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The Primal-Dual Active Set Strategy as a Semismooth Newton Method
Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients
A recursive quadratic programming method with active set strategy for optimal design
An Infeasible Active Set Method for Quadratic Problems with Simple Bounds
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
An improved active contours model for image segmentation by level set method
The primal-dual active set method for a crack problem with non-penetration
🆕 Influential since 2022
Conformal topology optimization of multi-material ferromagnetic soft active structures using an extended level set method
A velocity field level set method for topology optimization of piezoelectric layer on the plate with active vibration control
Level set-based topological design of multiphase micro-architectured materials using alternating active-phase method
Unified primal-dual active set method for dynamic frictional contact problems
Saturation Defense Method of a Power Cyber-physical System Based on Active Cut Set
📚 Books worth reading
The Art of Public SpeakingStephen E. Lucas · 1983
Argonauts of the western PacificBronisław Malinowski · 1922
Software EngineeringRoger S. Pressman, Bruce Maxim · 1982
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
Neural Information ProcessingTingwen Huang · 2012
Apache CookbookKen Coar, Rich Bowen · 2003
Optimization in Engineering SciencesPierre Borne, Abdelkader El Kamel · 2012
Data Communications and NetworkingBehrouz A. Forouzan, Catherine Ann Coombs · 2000
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Convex optimization Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently…
- Nonlinear programming In mathematics, nonlinear programming (NLP), also known as nonlinear optimization, is the process of solving an optimization problem where some of the…
- Mathematical optimization Mathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criteria…
- Quadratic programming Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks…
- Interior-point method Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs…
- Lagrange multiplier In mathematical optimization, the method of Lagrange multipliers is a strategy for finding the local maxima and minima of a function subject to equation…
- Augmented Lagrangian method Augmented Lagrangian methods are a certain class of algorithms for solving constrained optimization problems. They have similarities to penalty methods…
- Constrained optimization In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…