No article text was recorded for this version.
discrete-continuous optimization gap
Version 1 of 154 papers55 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Preface for the special edition of optimization methods and software
- Blog: Data-Driven Combinatorial Optimisation (Dagstuhl Seminar 22431)
- Blog: Playing with Duality: An Overview of Recent Primal-Dual Approaches for Solving Large-Scale Optimization Problems
- Blog: Synthesized Differentiable Programs
- Blog: Why Popular MOEAs Are Popular: Proven Advantages in Approximating the Pareto Front
- Blog: A UAV path planning method based on the framework of multi-objective jellyfish search algorithm
- Blog: Data Pooling in Stochastic Optimization
- Blog: Curve fitting based shared cache partitioning scheme for energy saving
- Blog: On Approximation Guarantees for Greedy Low Rank Optimization
- Blog: A Recursive Scenario Decomposition Algorithm for Combinatorial Multistage Stochastic Optimisation Problems
- Blog: Solver-Free Decision-Focused Learning for Linear Optimization Problems
- Blog: Difference of submodular minimization via DC programming
- Blog: Smoothing a Program Soundly and Robustly
- Blog: Submodular + Concave
- Blog: NLCertify: A Tool for Formal Nonlinear Optimization
- Blog: A Theoretical Perspective on Why Stochastic Population Update Needs an Archive in Evolutionary Multi-objective Optimization
- Blog: Multi-start Optimization Method via Scalarization based on Target Point-based Tchebycheff Distance for Multi-objective Optimization
- Blog: Safe Element Screening for Submodular Function Minimization
- Blog: Difference of submodular minimization via DC programming
- Blog: Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings
- Blog: Learn The Big Picture: Representation Learning for Clustering
- Blog: pyribs: A Bare-Bones Python Library for Quality Diversity Optimization
- Blog: Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?
- Blog: Decomposable Submodular Function Minimization: Discrete and Continuous
- Blog: Discrepancy Minimization via Regularization
- Blog: On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
- Blog: An Exact Penalty Method for Locally Convergent Maximum Consensus
- Blog: A hybrid particle swarm optimization algorithm for solving engineering problem
- Blog: Array Pattern Synthesis Using 4-bit Discrete Digital Shifters by Classic Particle Swarm Optimization
- Blog: Analysis of The Behavior of MGG and JGG As A Selection Model for Real-coded Genetic Algorithms
- Blog: Proximal-like algorithms for equilibrium seeking in mixed-integer Nash equilibrium problems
- Blog: Preface to the Special Issue on Theory of Genetic and Evolutionary Computation
- Blog: Intelligence and Cooperative Search by Coupled Local Minimizers
- Blog: Activity Analysis: The Qualitative Analysis of Stationary Points for Optimal Reasoning
- Blog: Beyond Gradient Descent for Regularized Segmentation Losses
- Blog: Special Issue on Theory and Applications of Models of Computation TAMC 2022
- Blog: Scalable Acceleration for Classification-Based Derivative-Free Optimization
- Blog: Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains
- Blog: Runtime Analyses of NSGA-III on Many-Objective Problems
- Blog: Initial version of State Transition Algorithm
- Blog: DAG Learning on the Permutahedron
- Blog: A discrete Farkas lemma
- Blog: On the Topology of Genetic Algorithms
- Blog: Large-Scale Price Optimization via Network Flow
- Blog: Towards Hybrid-Optimization Video Coding
- Blog: Gradient-Based Algorithms for Convex Discrete Optimization via Simulation
- Blog: Deep Supervised Summarization: Algorithm and Application to Learning Instructions
- Blog: A Spider Monkey Optimization Algorithm Combining Opposition-Based Learning and Orthogonal Experimental Design
- Blog: Running Time Analysis of MOEA/D with Crossover on Discrete Optimization Problem
- Blog: Theory of Randomized Optimization Heuristics (Dagstuhl Reports 19431)
- Blog: Faster Generation of Random Spanning Trees.
- Blog: Fractional Programming for Communication Systems-Part I: Power Control and Beamforming
- Blog: Reinforcement learning based adaptive metaheuristics
- Blog: Constraint Satisfaction as Global Optimization
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_discrete_continuous_optimization_gap_3794cdba,
title = {discrete-continuous optimization gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/discrete-continuous-optimization-gap/rdr_3794cdba494c45a98d898792f6c4d1a3},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_discrete_continuous_optimization_gap_3794cdba_v1,
title = {discrete-continuous optimization gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/discrete-continuous-optimization-gap/rdr_3794cdba494c45a98d898792f6c4d1a3/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}