yusuke1997/dblp-id-title huggingface dataset:
Semidefinite representation of convex sets
The alternating basis algorithm for assignment problems
Directional derivatives for the value-function in semi-infinite programming
Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
Computing optimal scalings by parametric network algorithms
Exploiting partial correlations in distributionally robust optimization
An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
Analysis of a linearization heuristic for single-machine scheduling to maximize profit
Regression, curvature and weighted least squares
Improving the approximation ratio for capacitated vehicle routing
Quadratic termination properties of Davidon's new variable metric algorithm
Theory and algorithms for linear multiple objective programs with zero-one variables
A separation algorithm for the matchable set polytope
Bounds on linear PDEs via semidefinite optimization
Goal programming sensitivity analysis using interval penalty weights
On a general saddle-point condition in normed spaces
A comparison of complete global optimization solvers
On the integrality gap of the subtour LP for the 1, 2-TSP
Warm start of the primal-dual method applied in the cutting-plane scheme
Karmarkar's Algorithm with Improved Steps
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
Generalized stochastic Frank-Wolfe algorithm with stochastic "substitute" gradient for structured convex optimization
The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
T-space and cutting planes
A note on 'new algorithms for constrained minimax optimization'
Approximating the little Grothendieck problem over the orthogonal and unitary groups
Exploiting orbits in symmetric ILP
Shorter tours and longer detours: uniform covers and a bit beyond
Some properties of the assignment polytope
Exploiting negative curvature in deterministic and stochastic optimization
An O(n 3 L) adaptive path following algorithm for a linear complementarity problem
Explicit convex and concave envelopes through polyhedral subdivisions
Sparse regression at scale: branch-and-bound rooted in first-order optimization
On the complexity of solving feasible systems of linear inequalities specified with approximate data
Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
Impacs - A bus crew scheduling system using integer programming
Global optimization using special ordered sets
Correction to: Stronger MIP formulations for the Steiner forest problem
An ε-relaxation method for separable convex cost generalized network flow problems
Optimal and sub-optimal stopping rules for the Multistart algorithm in global optimization
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
Minimum node covers and 2-bicritical graphs
A new solvable case of the traveling salesman problem
Duality in generalized linear fractional programming
An inexact successive quadratic approximation method for L-1 regularized optimization
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
On the reporting of computational experiments
Coupled and k-sided placements: generalizing generalized assignment
On the L infinity -norm of extreme points for crossing supermodular directed network LPs
The mathematics of playing golf, or: a new class of difficult non-linear mixed integer programs
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures
SIP: critical value functions have finite modulus of non-convexity
On the global convergence of a generalized iterative procedure for the minisum location problem with ℓ p distances for p > 2
Amenable cones: error bounds without constraint qualifications
Online k-taxi via Double Coverage and time-reverse primal-dual
Quadratic maximization and semidefinite relaxation
A randomized algorithm for fixed-dimensional linear programming
Some primal-dual theory for subgradient methods for strongly convex optimization
No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
On the complexity of finding a local minimizer of a quadratic function over a polytope
A unified framework for primal-dual methods in minimum cost network flow problems
Single-commodity robust network design with finite and Hose demand sets
An inexact Newton method for nonconvex equality constrained optimization
An elementary survey of general duality theory in mathematical programming
On the choice of parameters for power-series interior point algorithms in linear programming
On second-order conditions in unconstrained optimization
A Note on an Implementation of a Method for Quadratic Semi-Infinite Programming
Exploiting special structure in Karmarkar's linear programming algorithm
Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming
A robustification approach in unconstrained quadratic optimization
Nonlinear programming via an exact penalty function: Global analysis
Sparse PCA on fixed-rank matrices
Nonlinear 0-1 programming: I. Linearization techniques
On the rate of convergence of certain methods of centers
Nonsmooth nonconvex-nonconcave minimax optimization: Primal-dual balancing and iteration complexity analysis
Near-perfect matrices
On the generic properties of convex optimization problems in conic form
Deforming Subdivisions
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
A cutting plane approach to capacitated lot-sizing with start-up costs
On the separation of maximally violated mod- k cuts
A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
Foreword: Special issue on nonlinear convex optimization and variational inequalities
Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
Distributionally robust shortfall risk optimization model and its approximation
The least prior deviation quasi-Newton update
A distributionally robust perspective on uncertainty quantification and chance constrained programming
On the 0/1 knapsack polytope
Matrix discrepancy and the log-rank conjecture
Robust spectral risk optimization when the subjective risk aversion is ambiguous: a moment-type approach
Markovian traffic equilibrium
Efficient separation routines for the symmetric traveling salesman problem II: separating multi handle inequalities
Optimal design of a membrane separation process using signomial programming
A survey of search directions in interior point methods for linear programming
Linear programming, complexity theory and elementary functional analysis
Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty
A note on bicriterion programming
Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
A descent method with linear programming subproblems for nondifferentiable convex optimization
Optimality conditions and global convergence for nonlinear semidefinite programming
Foreword: special issue on nonsmooth optimization and applications
Asymptotic behavior of the central path for a special class of degenerate SDP problems
Extension of primal-dual interior point algorithms to symmetric cones
Relaxations for two-level multi-item lot-sizing problems
Accelerated proximal point method for maximally monotone operators
(1, k)-Configuration Facets for the Generalized Assignment Problem
The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
Neural networks with linear threshold activations: structure and algorithms
Approximation algorithms for general packing problems and their application to the multicast congestion problem
Preference ambiguity and robustness in multistage decision making
Minimality and complementarity properties associated with Z-functions and M-functions
An accelerated distributed stochastic gradient method with momentum
Sparse PSD approximation of the PSD cone
A retrospective trust-region method for unconstrained optimization
The integrality number of an integer program
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results
Distributed nonconvex constrained optimization over time-varying digraphs
On the stability of solutions to quadratic programming problems
Maximization of A convex quadratic function under linear constraints
Convex composite non-Lipschitz programming
Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm
Stochastic quasi-gradient methods: variance reduction via Jacobian sketching
Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
Efficient enumeration of the vertices of polyhedra associated with network LP's
Hit-and-run mixes fast
Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems
Structural and algorithmic properties for parametric minimum cuts
Comparison of bundle and classical column generation
Newton-type methods for unconstrained and linearly constrained optimization
On variational inequalities over polyhedral sets
Generalized mixed integer rounding inequalities: facets for infinite group polyhedra
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
Stability analysis of stochastic programs with second order dominance constraints
Accelerating the DC algorithm for smooth functions
Coefficient strengthening: a tool for reformulating mixed-integer programs
Computational results of an interior point algorithm for large scale linear programming
ALSO-X#: better convex approximations for distributionally robust chance constrained programs
On the core of linear production games
A Lagrange-Newton algorithm for sparse nonlinear programming
Robust solutions of Linear Programming problems contaminated with uncertain data
A Short Proof of Finiteness of Murty's Principal Pivoting Algorithm
Facets from gadgets
ℓ 1 -Sparsity approximation bounds for packing integer programs
Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints
Dual conditions characterizing optimality for convex multi-objective programs
Valid inequalities for MIPs and group polyhedra from approximate liftings
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
A note on harmonious families
On the optimality of pseudo-polynomial algorithms for integer programming
Mathematical programming problems with quasi-convex objective functions
Total dual integrality implies local strong unimodularity
Compact formulations as a union of polyhedra
Traveling salesman path problems
A quasi-Newton strategy for the sSQP method for variational inequality and optimization problems
Piecewise convex programs
On the nucleolus of the basic vehicle routing game
A bad network problem for the simplex method and other minimum cost flow algorithms
Golden ratio algorithms for variational inequalities
Active Set Algorithms for Isotonic Regression; A Unifying Framework
Finding all solutions to polynomial systems and other systems of equations
How many matchings cover the nodes of a graph?
Probability estimation via policy restrictions, convexification, and approximate sampling
Benchmarking optimization software with performance profiles
The primal-dual method for approximation algorithms
A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
On generalized surrogate duality in mixed-integer nonlinear programming
Convergence theory for nonconvex stochastic programming with an application to mixed logit
A unification of the existence theorems of the nonlinear complementarity problem
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
Recent advances in unconstrained optimization
Cut generation for optimization problems with multivariate risk constraints
Capacitated facility location: Separation algorithms and computational experience
Probability maximization via Minkowski functionals: convex representations and tractable resolution
An augmented Lagrangian approach for sparse principal component analysis
A monotone complementarity problem with feasible solutions but no complementary solutions
Blocking and anti-blocking pairs of polyhedra
Distributional utility preference robust optimization models in multi-attribute decision making
A new contraction technique with applications to congruency-constrained cuts
Validation analysis of mirror descent stochastic approximation method
A branch and bound algorithm for the generalized assignment problem
Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming
An independent benchmarking of SDP and SOCP solvers
Sample average approximation with sparsity-inducing penalty for high-dimensional stochastic programming
Semi-continuous network flow problems
On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones
Constraint identification and algorithm stabilization for degenerate nonlinear programs
Generalized scaling for the constrained maximum-entropy sampling problem
Homogeneous second-order descent framework: a fast alternative to Newton-type methods
A polyhedral study of the generalized vertex packing problem
On box totally dual integral polyhedra
On the chromatic polynomial of a graph
Towards an optimal contention resolution scheme for matchings
On the structure of all minimum cuts in a network and applications
On the computational complexity of piecewise-linear homotopy algorithms
On the existence and approximation of zeroes
On a homogeneous algorithm for the monotone complementarity problem
Uniqueness for solutions of differential complementarity problems
A combined conjugate-gradient quasi-Newton minimization algorithm
Optimality conditions for non-finite valued convex composite functions
The trust region subproblem with non-intersecting linear constraints
On decision rules in stochastic programming
Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
On the core and nucleolus of minimum cost spanning tree games
Subgradient optimization applied to a discrete nonlinear problem in engineering design
Reverse split rank
Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
Assessing solution quality in stochastic programs
Some properties of convex hulls of integer points contained in general convex sets
An analytical approach to global optimization
Concave minimization via conical partitions and polyhedral outer approximation
An improved version of the out-of-kilter method and a comparative study of computer codes
Optimal control of infinite dimensional bilinear systems: application to the heat and wave equations
An efficient cost scaling algorithm for the assignment problem
Finding simplicial subdivisions of polytopes
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem
The Generalized Assignment Problem: Valid Inequalities and Facets
A cutting plane algorithm for the General Routing Problem
Configuration balancing for stochastic requests
Representing the space of linear programs as the Grassmann manifold
A finite algorithm to maximize certain pseudoconcave functions on polytopes
A deterministic algorithm for global optimization
On the number of iterations of Karmarkar's algorithm for linear programming
A projected newton method for l p norm location problems
Variable metric methods for minimizing a class of nondifferentiable functions
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
Solving staircase linear programs by the simplex method, 1: Inversion
Generalized conditioning based approaches to computing confidence intervals for solutions to stochastic variational inequalities
Error bounds for inequality systems defining convex sets
Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
The (2 n+1 -2)-ray algorithm: A new simplicial algorithm to compute economic equilibria
Packing under convex quadratic constraints
On convergence of the Gauss-Newton method for convex composite optimization
A simple and fast linear-time algorithm for divisor methods of apportionment
Efficient separation of RLT cuts for implicit and explicit bilinear terms
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
Facial reduction in partially finite convex programming
Dual bin packing with items of random sizes
Solving mixed integer nonlinear programs by outer approximation
Least absolute value and chebychev estimation utilizing least squares results
Lattice closures of polyhedra
A normal fan projection algorithm for low-rank optimization
Two-edge connected spanning subgraphs and polyhedra
A practical relative error criterion for augmented Lagrangians
Primal-dual nonlinear rescaling method with dynamic scaling parameter update
Cyclic group and knapsack facets
Convergence rate of inertial Forward-Backward algorithm beyond Nesterov's rule
A trust region method for minimization of nonsmooth functions with linear constraints
Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
An economic model of short-rotation forestry
Stability of the linear complementarity problem at a solution point
A primal-proximal heuristic applied to the French Unit-commitment problem
On approximating complex quadratic optimization problems via semidefinite programming relaxations
Strong lift-and-project cutting planes for the stable set problem
On the strength of Gomory mixed-integer cuts as group cuts
A hybrid stochastic optimization framework for composite nonconvex optimization
Ideal formulations for constrained convex optimization problems with indicator variables
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
Iteratively reweighted least squares and slime mold dynamics: connection and convergence
Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
A general model for matroids and the greedy algorithm
A simple randomised algorithm for convex optimisation - Application to two-stage stochastic programming
A gradient sampling algorithm for stratified maps with applications to topological data analysis
Win probabilities and simple majorities in probabilistic voting situations
Lexicography and degeneracy: can a pure cutting plane algorithm work?
A weighted even factor algorithm
Vectorization and multitasking of nonlinear network programming algorithms
Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods
Proximity theorems of discrete convex functions
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Implicit functions and sensitivity of stationary points
Global convergence in infeasible-interior-point algorithms
Generalized dynamic programming methods in integer programming
Worst case analysis of a class of set covering heuristics
Optimal design of efficient acoustic antenna arrays
Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications
Optimum matching forests II: General weights
A monotonic passy-like algorithm for the modular design problem
An application of homotopy to solving linear programs
Some theoretical implications of local optimization
LP-based online scheduling: from single to parallel machines
Several approaches for the derivation of stationarity conditions for elliptic MPECs with upper-level control constraints
Mixed semicontinuous perturbations of nonconvex sweeping processes
Is bilevel programming a special case of a mathematical program with complementarity constraints?
Investigation of some branch and bound strategies for the solution of mixed integer linear programs
Computing deep facet-defining disjunctive cuts for mixed-integer programming
Finiteness of conical algorithms with ω-subdivisions
New algorithms for linear k-matroid intersection and matroid k-parity problems
Clique-circulants and the stable set polytope of fuzzy circular interval graphs
Input optimization: I. Optimal realizations of mathematical models
A semidefinite programming approach to the generalized problem of moments
Counterexample and an additional revealing poll step for a result of "analysis of direct searches for discontinuous functions"
On some properties of L 1 estimators
A semidefinite programming hierarchy for packing problems in discrete geometry
A strategy for array management in local memory
On the existence of Pareto solutions for polynomial vector optimization problems
Equivariant perturbation in Gomory and Johnson's infinite group problem - III: foundations for the k-dimensional case with applications to k=2
An optimization approach to the problem of protein structure prediction
Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
On the graphical relaxation of the symmetric traveling salesman polytope
A parametric view on the Mangasarian-Fromovitz constraint qualification
Convergence rates for sums-of-squares hierarchies with correlative sparsity
Elimination of bounds in optimization problems by transforming variables
Primal-dual stability in continuous linear optimization
Examples of ill-behaved central paths in convex optimization
Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
The rectilinear class Steiner tree problem for intervals on two parallel lines
Positivity certificates and polynomial optimization on non-compact semialgebraic sets
New valid inequalities and formulations for the static joint Chance-constrained Lot-sizing problem
Faster goal-oriented shortest path search for bulk and incremental detailed routing
Primal - dual methods for linear programming
On the necessity of the Moreau-Rockafellar-Robinson qualification condition in Banach spaces
A quasi-Newton trust-region method
Erratum to: The capacitated max k -cut problem
Stable set polytopes with high lift-and-project ranks for the Lovász-Schrijver SDP operator
New analysis and results for the Frank-Wolfe method
Constructive proofs of theorems relating to: F(x) = y , with applications
A competitive (dual) simplex method for the assignment problem
Optimal conditioning of self-scaling variable Metric algorithms
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
The simultaneous semi-random model for TSP
Cutting planes from extended LP formulations
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
A quadratically convergent O((k+1)root(n)L)-iteration algorithm for the P(k)-matrix linear complementarity problem
Faster first-order primal-dual methods for linear programming using restarts and sharpness
Concave duality: Application to problems dealing with difference of functions
Tacit collusion games in pool-based electricity markets under transmission constraints
Accelerated first-order methods for hyperbolic programming
On the multiplicity of solutions in generation capacity investment models with incomplete markets: a risk-averse stochastic equilibrium approach
Sparse graphs and an augmentation problem
Chance constrained uncertain classification via robust optimization