Articles in This Field
Convex Duality and KKT Conditions: A Working Guide to Lagrangians, Certificates, and Sensitivity
Optimization becomes dramatically more predictable when convexity is present. Convex problems admit a precise notion of “no hidden traps”: any locally optimal point is globally optimal, and the geometry of feasible sets allows constraints to be handled by algebraic certificates rather than guesswork. Convex duality is the formal mechanism that turns these geometric facts into […]
Gradient Methods in Practice: Step Sizes, Smoothness, and Convergence Guarantees You Can Use
Gradient-based methods are the default workhorses of continuous optimization because they are simple, scalable, and broadly applicable. Their behavior, however, depends decisively on one choice: how far to move each step. Step-size selection is not an implementation detail; it is the mechanism that turns a descent direction into a convergent algorithm. The core theory of […]
Proximal and Splitting Methods: Regularization, Composite Objectives, and ADMM as a Design Pattern
Many modern optimization problems have the form “smooth loss plus nonsmooth structure.” The loss measures fit to data or agreement with constraints; the nonsmooth term enforces sparsity, robustness, or other desired behavior. These problems are often convex and highly structured, but that structure is invisible to plain gradient descent because nonsmooth terms break differentiability. Proximal […]
A Proof Strategy Guide for Optimization: Starting with Convexity
Optimization is full of techniques, but proofs in optimization are mostly built from a small set of reusable ideas. If you can recognize which idea is supposed to fire in a given problem, you can read papers faster, debug your own arguments, and avoid chasing the wrong kind of estimate. Convexity is the best entry […]
Building Examples in Optimization: A Practical Recipe
It is easy to learn optimization by absorbing a list of methods and examples that somebody else chose. It is harder, and far more valuable, \to learn how to manufacture examples on demand: examples that isolate a single phenomenon, expose a hidden hypothesis, or stress-test a theorem at its boundary. This article is a recipe […]
Common Mistakes in Optimization and How to Avoid Them
Optimization is a subject where small misunderstandings propagate into large errors. A single misapplied condition can turn a true theorem into a false claim, or can make an algorithm look correct while quietly solving the wrong problem. This article collects common mistakes that appear in coursework, research writing, and implementation. The emphasis is not on […]
Subfields
No subfields yet.
Study Topics
- A Proof Strategy Guide for Optimization: Starting with Convexity
- Building Examples in Optimization: A Practical Recipe
- Common Mistakes in Optimization and How to Avoid Them
- Convex Duality and KKT Conditions: A Working Guide to Lagrangians, Certificates, and Sensitivity
- Gradient Methods in Practice: Step Sizes, Smoothness, and Convergence Guarantees You Can Use
- Proximal and Splitting Methods: Regularization, Composite Objectives, and ADMM as a Design Pattern
- Second-Order Methods and Newton-Type Algorithms: Quadratic Models, Line Search, and Trust Regions
- Interior-Point Methods for Convex Optimization: Barrier Functions, Central Path, and Practical Geometry
- Stochastic Optimization for Large-Scale Problems: SGD, Mini-Batches, and Variance Reduction
Related Topics
Algebra
- A Proof Strategy Guide for Algebra: Starting with Symmetry
- Building Examples in Algebra: A Practical Recipe
- Computing with Algebra: What Survives Discretization
- Generators and Relations Done Right: Presentations, Normal Forms, and What They Actually Prove
- Tensor Products Without Tears: How Algebra Forces the Universal Bilinear Object
- The First Isomorphism Theorem as a Workhorse in Algebra: Kernels, Images, and Structure
Analysis and Partial Differential Equations
- A Counterexample That Teaches Analysis and Partial Differential Equations Better Than a Lecture
- A Proof Strategy Guide for Analysis and Partial Differential Equations: Starting with Regularity
- Analysis and Partial Differential Equations and the Art of Choosing the Right Notation
- Analysis and Partial Differential Equations Through Worked Examples: Estimates as the Thread
- Building Examples in Analysis and Partial Differential Equations: A Practical Recipe
- Common Mistakes in Analysis and Partial Differential Equations and How to Avoid Them
Category Theory
- A Counterexample That Teaches Category Theory Better Than a Lecture
- Category Theory and the Art of Choosing the Right Notation
- Category Theory as a Language: What It Lets You Say Precisely
- Category Theory Through Worked Examples: Adjunctions as the Thread
- Five Standard Proof Patterns in Category Theory
- From Definitions to Power: The Minimal Core of Category Theory
Related Fields
Mathematics
Mathematics fields mapped as stable hub paths that follow prerequisites from foundations to advanced topics.
Algebra
Analysis and Partial Differential Equations
Category Theory
Combinatorics
Dynamical Systems
Geometry
Logic and Foundations
Mathematical Physics
Number Theory
Numerical Analysis
Science
Natural and applied sciences mapped as stable hub paths for focused study from fundamentals to applications.
Philosophy
Philosophy fields mapped as stable hub paths for core questions, key arguments, and major positions.
History
History fields mapped as stable hub paths across periods, regions, methods, and themes for deep study.
Logic
Philosophy of Mathematics