Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
An approximation algorithm efficiently returns a feasible solution with a proved performance guarantee relative to the optimum. The guarantee must specify whether the problem is a maximization or minimization problem.
An outcome is Pareto efficient when no feasible alternative weakly improves every agent's utility and strictly improves at least one. For strict preference orders over distinct alternatives, an outcome unanimously ranked below another is inefficient. Onto strategyproof social choice functions on an unrestricted domain are Pareto efficient: rank-raising monotonicity and unanimity rule out selecting a unanimously dominated alternative.
Variational analysis studies optimization, perturbation stability and generalized differentiation through functions, sets and set-valued mappings. Convex analysis is a foundational special case; limiting normal constructions also handle nonconvex geometry.
A parametric optimization problem has objective or constraints depending on input data. Its optimizer set is a solution map of a parametric optimization problem. Sensitivity analysis asks how this map changes as the data vary.
A minimization problem seeks a feasible point with smallest objective value. Its infimum can be finite without being attained, or equal to when unbounded below. Negating the objective converts it to a maximization problem.
A maximization problem seeks a feasible point with largest objective value. Its supremum can fail to be attained or be infinite. Negating the objective gives a minimization problem. A global extremum of an optimization Lagrangian can certify a feasible optimum by the Lagrangian sufficiency theorem.
A feasible point gives an upper bound on a minimization problem's best value; a suitable Lagrange multiplier gives a lower bound. Lagrangian duality searches for the strongest bound obtainable this way. Matching bounds certify a global minimum.
Let be a nonempty decision domain on which the objective function and the constraint functions are finite. Write the primal problem and its optimization Lagrangian asThe inequality Lagrange multipliers obey ; the equality Lagrange multipliers are unrestricted real numbers. Define the Lagrange dual function and dual optimal value byThe inner infimum keeps , but releases the displayed optimization constraints. It can be , giving an uninformative lower bound. A different domain changes the bound.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §§5.1.1–5.1.3, printed pp. 215–216: domain, Lagrangian, dual function and lower bounds
Here is the entire weak duality argument. For any feasible point and allowable Lagrange multipliers,The first inequality is the definition of an infimum; the second uses and . Taking the infimum over feasible , then the supremum over allowable Lagrange multipliers, gives . No convexity is used.
The Lagrange dual function is a concave function, since each fixed decision makes an affine function of the Lagrange multipliers.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §5.1.2, printed p. 216: pointwise infimum of affine functions
Explicitly, write and choose two points where is finite. For and every ,Taking the infimum over proves the defining concavity inequality. Thus even a difficult primal problem supplies a dual with useful geometry, although evaluating can itself be difficult.For finite optimal values, strong duality means , or zero duality gap. It need not imply dual attainment. For convex optimization, Slater's condition is a sufficient constraint qualification for both when is finite.[ref]
Convex Optimization by Stephen Boyd and Lieven Vandenberghe. §§5.2.2–5.2.3, printed pp. 225–227: gap, strong duality and Slater dual attainment
The Strong Lagrangian property requires an actual finite Lagrange multiplier achieving equality. Convex perturbation duality interprets such a bound as a supporting slope of the perturbed value function.At an interior local extremum of a differentiable function, its gradient is zero: restricting the function to every line through the point shows that all directional derivatives vanish. This is only a necessary condition in general. For a strictly concave function, an interior stationary point is the unique global maximizer on its convex domain. Constrained or boundary optima instead need conditions adapted to their feasible directions.
In collisional ionization, an energetic collision frees a bound electron. The process consumes kinetic energy and changes the electron and ion populations controlling plasma cooling. In a thermal gas its rate competes with recombination and depends strongly on the ionization threshold relative to temperature.
A free electron can be captured by an ion while a photon carries away binding and kinetic energy. This radiative recombination process contributes free-bound radiation to plasma cooling and balances collisional ionization in a collisional-equilibrium plasma.
Photoionization removes a bound electron when an atom or ion absorbs a sufficiently energetic photon. The threshold is its ionization energy. The excess photon energy becomes kinetic energy of the products; subsequent collisions can heat the gas or cause secondary ionizations. A photoionization rate and a photoionization equilibrium are distinct concepts: equilibrium also requires specified recombination and other reaction rates.
The periodic Hamiltonian chain , with cyclic indices, is a Liouville integrable system. Exponentials of neighbouring coordinate differences lead to a Lax pair and conserved characteristic coefficients.
An auxiliary function used in Hirota's bilinear method to encode a solution of an integrable partial differential equation. Products and ratios of tau functions replace nonlinear field variables; their differential equations become bilinear. In a Sine-Gordon multisoliton tau representation, two real tau functions encode the field as a continuous .
An exact-solution method that transforms a nonlinear partial differential equation into equations bilinear in auxiliary Hirota tau functions. Finite exponential expansions of the Hirota tau functions produce soliton families. The auxiliary exponential coefficients need not all be positive.
For a finite-dimensional Hamiltonian system, integrability is normally expressed by enough independent first integrals in mutual Poisson bracket involution. In classical field theories, an infinite hierarchy of compatible conserved quantities is the corresponding structure. For Sine-Gordon theory, Bäcklund transformations generate local conservation laws and explicit soliton solutions. Conservation of arbitrary quantities alone should not be confused with proof of their Hamiltonian involution.
A parameter-dependent system of differential relations maps a solution of one differential equation to a solution of another, or to a new solution of the same equation. Compatibility of the relations supplies the equations of motion. Integration constants select a particular transformed field. The Sine-Gordon Bäcklund transformation is an example of an auto-transformation and also generates conserved currents.
Image noise is unwanted variation in an observed image signal. In an additive model , Gaussian noise motivates a squared data-fidelity penalty, while other statistics require different penalties. Image smoothing suppresses rapid fluctuations, but a filter must distinguish noise from genuine image edges.
image edge enhancement increases the apparent sharpness or contrast of an image edge. Unsharp masking gives bounded linear high-frequency amplification; backward normal diffusion in the Perona-Malik equation gives formal nonlinear sharpening with ill-posedness risks. Positive diffusion tensors chiefly preserve or connect structure rather than perform unbounded backward diffusion.
The Bohr model assumes circular electron orbits with quantized orbital angular momentum . It reproduces the hydrogen energy levels, but wavefunctions in quantum mechanics describe spatial probability distributions rather than definite trajectories. In particular, spherically symmetric Coulomb bound states have zero orbital angular momentum.
The puzzle is the coexistence of reproducible spectral lines and stable chemical atoms. A classical circular orbit in a Coulomb potential can have any negative energy: Coulomb's law alone selects no special radius or emitted frequency. Moreover, its electron has centripetal acceleration. The Larmor formula then predicts positive radiated power, so conservation of energy makes the orbit shrink. Simply drawing concentric circles explains neither stability nor a discrete spectrum.
Niels Bohr postulated nonradiating stationary states and emission with . His circular-orbit condition is . These assumptions override classical radiation; the emitted frequency need not equal an orbital frequency.[ref]
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





