yusuke1997/dblp-id-title huggingface dataset:
A simulation-based approach to two-stage stochastic programming with recourse
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
An analogue of Hoffman's circulation conditions for max-balanced flows
Realizability and inscribability for simplicial polytopes via nonlinear optimization
A faster capacity scaling algorithm for minimum cost submodular flow
Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
On minquantile and maxcovering optimisation
Worst-case analysis of greedy algorithms for the subset-sum problem
Trajectory nets connecting all critical points of a smooth function
An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
A class of rank-two ellipsoid algorithms for convex programming
Local minima for indefinite quadratic knapsack problems
Stochastic programming with integer variables
The two-level diameter constrained spanning tree problem
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
Extended formulations for sparsity matroids
New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
Static arbitrage bounds on basket option prices
Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
On the cost of approximating all roots of a complex polynomial
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
Polyhedral annexation in mixed integer and combinatorial programming
Special issue on "Integer programming under uncertainty"
On the split closure of the periodic timetabling polytope
Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints
Duality for extended infinite monotropic optimization problems
A class of simplicial restart fixed point algorithms without an extra dimension
A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
Free material optimization via mathematical programming
Pure adaptive search in monte carlo optimization
ReLU neural networks of polynomial size for exact maximum flow computation
Optimization with multivariate stochastic dominance constraints
Optimal wire ordering and spacing in low power semiconductor design
Optimality conditions for nonconvex semidefinite programming
Computing clique and chromatic number of circular-perfect graphs in polynomial time
Extremization of functions with equality constraints
Goal scoring, coherent loss and applications to machine learning
Sample average approximation of stochastic dominance constrained programs
Linear max-min programming
Risk preferences on the space of quantile functions
Mixed integer programming for a special logic constrained optimal control problem
Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results
Formulations and valid inequalities for the node capacitated graph partitioning problem
Continuous relaxation for discrete DC programming
An interior point algorithm of O(Quadrat Root(m) absolute (ln epsilon)) iterations for C-convex programming
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
A study of the lot-sizing polytope
Strong duality and sensitivity analysis in semi-infinite linear programming
A polyhedral study of production ramping
Towards equitable distribution via proportional equity constraints
On the continuity of a Lagrangian multiplier function in input optimization
Two generalizations of Dykstra's cyclic projections algorithm
A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity
Linear optimization with cones of moments and nonnegative polynomials
Subcontracting and lot-sizing with constant capacities
How to compute the volume in high dimension?
A note on some computationally difficult set covering problems
Approximate iterations in Bregman-function-based proximal algorithms
Affine scaling algorithm fails for semidefinite programming
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
Parallel branch, cut, and price for large-scale discrete optimization
Distributionally robust optimization with polynomial densities: theory, models and algorithms
Error bounds and a condition number for the absolute value equations
On finite termination of an iterative method for linear complementarity problems
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
First-order dominance: stronger characterization and a bivariate checking algorithm
A hierarchy of bounds for stochastic mixed-integer programs
A new condition number for linear programming
Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
Parametrizations of Kojima's system and relations to penalty and barrier functions
Submodular maximization meets streaming: matchings, matroids, and more
Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
The Kantorovich Theorem and interior point methods
Robust k-center with two types of radii
A modified layered-step interior-point algorithm for linear programming
On the limit of multiple packings
n-step mingling inequalities: new facets for the mixed-integer knapsack set
Increasing the rooted-connectivity of a digraph by one
Large-scale linear programming: Geometry, working bases and factorizations
Modified regularity conditions for nonlinear programming problems over mixed cone domains
A continuous approach to inductive inference
Alternatives for testing total dual integrality
Ratios of affine functions
On the greedy algorithm with random costs
Information complexity of mixed-integer convex optimization
Convergence rate of Newton's method for L 2 spectral estimation
On the computational utility of posynomial geometric programming solution methods
A note on column generation in Dantzig - Wolfe decomposition algorithms
(0, +-1) ideal matrices
New algorithms for generalized network flows
Regression analysis: likelihood, error and entropy
On the number of solutions to a class of linear complementarity problems
A Note on the Continuity of Solutions of Parametric Linear Programs
Long time missions and the fuel-optimal attitude maneuvering in a swinging mode
A mathematical programming system for preference and compatibility maximized menu planning and scheduling
Low-rank optimization on Tucker tensor varieties
Effort associated with a class of random optimization methods
'Fat' triangulations, or solving certain nonconvex matrix optimization problems
Persistency in quadratic 0-1 optimization
Independent packings in structured graphs
An interior point method in function space for the efficient solution of state constrained optimal control problems
Variational analysis of functions of the roots of polynomials
Robinson's implicit function theorem and its extensions
A New Theorem of the Alternative
A One-Phase Algorithm for Semi-Infinite Linear Programming
The all-or-nothing flow problem in directed graphs with symmetric demand pairs
An affine-scaling interior-point CBB method for box-constrained optimization
A note on treating a second order cone program as a special case of a semidefinite program
Facets of the Clique Partitioning Polytope
Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
n-Step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
Cross decomposition for mixed integer programming
Note on a method of conjugate subgradients for minimizing nondifferentiable functions
Towards explicit superlinear convergence rate for SR1
Homogenization of SGD in high-dimensions: exact dynamics and generalization properties
Monoidal strengthening and unique lifting in MIQCPs
Deciding whether a lattice has an orthonormal basis is in co-NP
Tight bounds for christofides' traveling salesman heuristic
Discontinuous piecewise linear optimization
Shortest path algorithms for knapsack type problems
Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
A fresh CP look at mixed-binary QPs: new formulations and relaxations
Metric regularity and quantitative stability in stochastic programs with probabilistic constraints
Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
Closed convex sets with an open or closed Gauss range
Recognizing binet matrices
The bilinear assignment problem: complexity and polynomially solvable special cases
A note on heuristics for the traveling salesman problem
Q-superlinear convergence of the iterates in primal-dual interior-point methods
A note on the regularity of reduced models obtained by nonlocal quasi-continuum-like approaches
Scheduling and fixed-parameter tractability
A primal-dual affine-scaling potential-reduction algorithm for linear programming
On maximization of quadratic form over intersection of ellipsoids with common center
The journal
Interpreting latent variables in factor models via convex optimization
Simple bounds for recovering low-complexity models
Lower bounds on nonnegative rank via nonnegative nuclear norms
Preventing redundant solutions in partial enumeration algorithms
Correction: An accelerated distributed stochastic gradient method with momentum
Credit risk optimization with Conditional Value-at-Risk criterion
Scenario tree generation for multiperiod financial optimization by optimal discretization
Packing in generalized kernel systems: a framework that generalizes packing of branchings
A framework of constraint preserving update schemes for optimization on Stiefel manifold
On A characterization of optimality in convex programming
Almost P 0 -matrices and the class Q
Nonlinear programming and nonsmooth optimization by successive linear programming
Branch and bound with estimation based on pseudo-shadow-prices
The ordered k-median problem: surrogate models and approximation algorithms
A generalization of column generation to accelerate convergence
Sparse representation of vectors in lattices and semigroups
A parallel implementation of the nested decomposition algorithm for multistage stochastic linear programs
Generalized Hessian for C 1, 1 functions in infinite dimensional normed spaces
Stability for linearly constrained optimization problems
How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths
On a primal-proximal heuristic in discrete optimization
A note on the prize collecting traveling salesman problem
Sparse quasi-Newton updates with positive definite matrix completion
An augmented Lagrangian method for distributed optimization
Sum-of-squares relaxations for polynomial min-max problems over simple sets
Interactions between nonlinear programming and modeling systems
Differentiability and semismoothness properties of integral functions and their applications
On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
Tikhonov regularization of a second order dynamical system with Hessian driven damping
A simplicial algorithm for the nonlinear complementarity problem
Concave regression: value-constrained estimation and likelihood ratio-based inference
On the solution of concave knapsack problems
A smooth method for the finite minimax problem
A quasi-second-order proximal bundle algorithm
Solution of the linear inverse vector optimization problem by a single linear program
On affine scaling and semi-infinite programming
The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming
Autoconjugate representers for linear monotone operators
Distributionally robust stochastic programs with side information based on trimmings
Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Representing simple d -dimensional polytopes by d polynomials
Integer linear programming models for 2-staged two-dimensional Knapsack problems
k-median: exact recovery in the extended stochastic ball model
The asymmetric traveling salesman path LP has constant integrality ratio
Second order algorithms for the posynomial geometric programming dual, part I: Analysis
Global optimization of univariate Lipschitz functions: I. Survey and properties
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
A note on polyhedral sets having A least element
A line search exact penalty method using steering rules
Linear programming and the newton barrier flow
Lower bounds for non-convex stochastic optimization
On the multiplier-penalty-approach for quasi-variational inequalities
Problems and methods with multiple objective functions
A solution framework for linear PDE-constrained mixed-integer problems
Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
Two stage linear programming under uncertainty with 0-1 integer first stage variables
A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programs
An extension of the simplex algorithm for semi-infinite linear programming
A bound-improving approach to discrete programming problems
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
Two-stage non-cooperative games with risk-averse players
A strongly polynomial algorithm for the transportation problem
Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 - and monotone LCP
Equilibrium routing under uncertainty
Lattice based extended formulations for integer linear equality systems
Analysis of the optimization landscape of Linear Quadratic Gaussian (LQG) control
On polynomiality of the method of analyitc centers for fractional problems
Limited-memory BFGS with displacement aggregation
Solving Lagrangian variational inequalities with applications to stochastic programming
Dynamic factorization in large-scale optimization
Solving cone-constrained convex programs by differential inclusions
A little theorem of the big Mu in interior point algorithms
Fully polynomial time (Σ , Π )-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
A linear-time algorithm for trust region problems
Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric
Approximate formulas of average distances associated with regions and their applications to location problems
Misspecified nonconvex statistical optimization for sparse phase retrieval
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
Penalty for zero-one integer equivalent problem
Directed submodularity, ditroids and directed submodular flows
Vertex downgrading to minimize connectivity
Affine-invariant contracting-point methods for Convex Optimization
Modeling combinatorial disjunctive constraints via junction trees
Critical solutions of nonlinear equations: local attraction for Newton-type methods
On co-positive, semi-monotone Q-matrices
From the Secretariat of the Mathematical Programming Society
Collusive game solutions via optimization
Errata: On semidefinite linear complementarity problems
A first-order augmented Lagrangian method for constrained minimax optimization
Online bipartite matching in the probe-commit model
A FPTAS for computing a symmetric Leontief competitive economy equilibrium
On quadratic and O(qudar root(n) * L) convergence of a predictor-corrector algorithm for LCP
Some 0/1 polytopes need exponential size extended formulations
On some polytopes contained in the 0, 1 hypercube that have a small Chvátal rank
A direct active set algorithm for large sparse quadratic programs with simple bounds
Properties of an interior embedding for solving nonlinear optimization problems
Direct methods with maximal lower bound for mixed-integer optimal control problems
A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming
A mesh-independence result for semismooth Newton methods
Capacitated, balanced, sequential location-allocation problems on chains and trees
On polyhedral extension of some LP theorems
Threshold Boolean form for joint probabilistic constraints with random technology matrix
Necessary conditions in optimal control: a new approach
Geometry of optimality conditions and constraint qualifications: The convex case
On the complexity of linear programming under finite precision arithmetic
Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph
Variational convergence of bivariate functions: lopsided convergence
A search for quantum coin-flipping protocols using optimization techniques
Hölder and Lipschitz stability of solution sets in programs with probabilistic constraints
A weighted gram-schmidt method for convex quadratic programming
A cutting plane algorithm for solving bilinear programs
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
Performance guarantees of local search for minsum scheduling problems
An exact combinatorial algorithm for minimum graph bisection
Critical angles in polyhedral convex cones: numerical and statistical considerations
On Lipschitz optimization based on gray-box piecewise linearization
Strong reductions for extended formulations
Maximal flow through a domain
On the positive sum property and the computation of Graver test sets
A method to accelerate the rate of convergence of a class of optimization algorithms
Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets
Unified complexity analysis for Newton LP methods
A semidefinite programming approach to a cross-intersection problem with measures
A robust and efficient method for solving point distance problems by homotopy
Polyhedral results for the edge capacity polytope
Tree metrics and edge-disjoint S-paths
A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse
On reduced convex QP formulations of monotone LCPs
A Practical and Optimal First-Order Method for Large-Scale Convex Quadratic Programming
An O(root(n)L) iteration bound primal-dual cone affine scaling algorithm for linear programming
The computation of pairwise stable networks
Equivalence of some quadratic programming algorithms
Z-eigenvalue methods for a global polynomial optimization problem
Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation
Complete characterizations of stable Farkas' lemma and cone-convex programming duality
On the p -Median polytope
The Held - Karp algorithm and degree-constrained minimum 1-trees
Semidefinite relaxations of ordering problems
Semicontinuous limits of nets of continuous functions
Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
On the complexity of computing the handicap of a sufficient matrix
Robust screening under ambiguity
Optimal location and design of a competitive facility
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems
An 𝒪 (m log n) algorithm for the weighted stable set problem in claw-free graphs with α(G) ≤ 3
Iteration complexity analysis of block coordinate descent methods
Supports and convex envelopes
The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
Online submodular maximization: beating 1/2 made simple
On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers
Revisiting k-sum optimization
Cutting-Plane Proofs in Polynomial Space
On the integer-valued variables in the linear vertex packing problem
The domino inequalities: facets for the symmetric traveling salesman polytope
Characterizations of optimal scalings of matrices
Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
Distances to lattice points in knapsack polyhedra
Tractable Approximations to Robust Conic Optimization Problems
Load balancing in the parallel optimization of block-angular linear programs
An exact Jacobian SDP relaxation for polynomial optimization
A technique for speeding up the solution of the Lagrangean dual
Interior-point methods: An old and new approach to nonlinear programming
Containing and Shrinking Ellipsoids in the Path-Following Algorithm
Preemptive and non-preemptive generalized min sum set cover
A game-theoretic approach to computation offloading in mobile cloud computing
Balas formulation for the union of polytopes is optimal
A "Build-Down" Scheme for Linear Programming
Randomly generated polytopes for testing mathematical programming algorithms
Robust linear semi-infinite programming duality under uncertainty
On the truncated conjugate gradient method
Applying FISTA to optimization problems (with or) without minimizers
Fixed parameter approximation scheme for min-max k-cut
Critical extreme points of the 2-edge connected spanning subgraph polytope
A rank-corrected procedure for matrix completion with fixed basis coefficients
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
Optimal 3-terminal cuts and linear programming
Optimization landscape of Tucker decomposition
Uses and abuses of statistical simulation
Computing the nucleolus of weighted cooperative matching games in polynomial time
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems
On the facets of mixed integer programs with two integer variables and two constraints
On robust optimization of two-stage systems
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
New global optima results for the Kauffman NK model: handling dependency
Complexity of linear relaxations in integer programming
Sum of squares generalizations for conic sets
Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
Mean and variance of waiting time and their optimization for alternating traffic control systems
S3 sets. An extension of the Beale-Tomlin special ordered sets
Laplacian eigenvalues and the maximum cut problem
Rectilinear group Steiner trees and applications in VLSI design
An algorithm for the determination of longest distances in a graph
A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds
Signature classes of transportation polytopes
An extension of Tarski's fixed point theorem and its application to isotone complementarity problems
Characterizing the universal rigidity of generic tensegrities
Semi-discrete optimal transport: hardness, regularization and numerical solution
Correction: Accelerated affine-invariant convergence rates of the Frank-Wolfe algorithm with open-loop step-sizes
Differential variational inequalities
Universal gradient methods for convex optimization problems
Solving k-cluster problems to optimality with semidefinite programming
On the rank of mixed 0, 1 polyhedra
On the complexity of following the central path of linear programs by linear extrapolation II