8 skills found
newca12 / Awesome Rust Formalized ReasoningAn exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
martinescardo / TypeTopologyLogical manifestations of topological concepts, and other things, via the univalent point of view.
zaklogician / Linear ConstructiveLinear Logic for Constructive Mathematics, in Agda
aliasgharheidaricom / RUN Beyond The Metaphor An Efficient Optimization Algorithm Based On Runge Kutta MethodThe optimization field suffers from the metaphor-based “pseudo-novel” or “fancy” optimizers. Most of these cliché methods mimic animals' searching trends and possess a small contribution to the optimization process itself. Most of these cliché methods suffer from the locally efficient performance, biased verification methods on easy problems, and high similarity between their components' interactions. This study attempts to go beyond the traps of metaphors and introduce a novel metaphor-free population-based optimization based on the mathematical foundations and ideas of the Runge Kutta (RK) method widely well-known in mathematics. The proposed RUNge Kutta optimizer (RUN) was developed to deal with various types of optimization problems in the future. The RUN utilizes the logic of slope variations computed by the RK method as a promising and logical searching mechanism for global optimization. This search mechanism benefits from two active exploration and exploitation phases for exploring the promising regions in the feature space and constructive movement toward the global best solution. Furthermore, an enhanced solution quality (ESQ) mechanism is employed to avoid the local optimal solutions and increase convergence speed. The RUN algorithm's efficiency was evaluated by comparing with other metaheuristic algorithms in 50 mathematical test functions and four real-world engineering problems. The RUN provided very promising and competitive results, showing superior exploration and exploitation tendencies, fast convergence rate, and local optima avoidance. In optimizing the constrained engineering problems, the metaphor-free RUN demonstrated its suitable performance as well. The authors invite the community for extensive evaluations of this deep-rooted optimizer as a promising tool for real-world optimization. The source codes, supplementary materials, and guidance for the developed method will be publicly available at different hubs at http://aliasgharheidari.com/RUN.html.
utahplt / Hott RealsHoTT Reals in Cubical Agda
AdrienTaylor / GreedyMethodsCode to reproduce the results presented in the work "Efficient First-order Methods for Convex Minimization: a Constructive Approach" (in Mathematical Programming series A) by Y. Drori and A. Taylor.
jonsterling / Twelf CmcpITT 1979 in Twelf (à la Constructive Mathematics and Computer Programming)
iblech / Constructive Maximal IdealsReifying dynamical algebra: maximal ideals in countable rings, constructively
