yusuke1997/dblp-id-title huggingface dataset:
Scenario reduction for stochastic programs with Conditional Value-at-Risk
A projected lagrangian algorithm for semi-infinite programming
Relaxations and approximations of chance constraints under finite distributions
Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
Guidelines for reporting results of computational experiments. Report of the ad hoc committee
Coderivatives in parametric optimization
A note on Faigle and Kern's dual greedy polyhedra
On stationary equilibria of a single-controller stochastic game
Multi-constrained matroidal knapsack problems
Generalized polymatroids and submodular flows
Spectral simplex method
Computational experience with a difficult mixed-integer multicommodity flow problem
Marginal values in mixed integer linear programming
On the complexity of detecting convexity over a box
The symmetric quadratic traveling salesman problem
A quadratically convergent method for minimizing a sum of euclidean norms
A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization
Strong Semismoothness of the Fischer-Burmeister SDC and SOC Complementarity Functions
Risk-averse feasible policies for large-scale multistage stochastic linear programs
A PL homotopy for finding all the roots of a polynomial
A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
Robust solution of monotone stochastic linear complementarity problems
Homeomorphisms of triangulations with applications to computing fixed points
A bilinear programming formulation of the 3-dimensional assignment problem
New results on the Windy Postman Problem
Two-stage linear decision rules for multi-stage stochastic programming
A differential equation approach to nonlinear programming
Polyhedral sets having a least element
Bilevel optimization: on the structure of the feasible set
Three modeling paradigms in mathematical programming
A superlinearly convergent algorithm for minimization without evaluating derivatives
On convex relaxations for quadratically constrained quadratic programming
Submodular optimization views on the random assignment problem
Aggregation and discretization in multistage stochastic programming
Convex hull results for generalizations of the constant capacity single node flow set
Optimal methods for convex nested stochastic composite optimization
Eventual convexity of probability constraints with elliptical distributions
Variation of cost functions in integer programming
Local convergence analysis of tensor methods for nonlinear equations
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
Unit stepsize for the Newton method close to critical solutions
A primal-dual trust-region algorithm for non-convex nonlinear programming
A new approach to the analysis of random methods for detecting necessary linear inequality constraints
Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
Lifting valid inequalities for the precedence constrained knapsack problem
Generalizations of Slater's constraint qualification for infinite convex programs
Hypergraph k-cut in randomized polynomial time
On the continuous quadratic knapsack problem
Beating the 2-approximation factor for global bicut
A numerically stable optimization method based on A homogeneous function
Semidefinite programming relaxations for semialgebraic problems
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
Designing tractable piecewise affine policies for multi-stage adjustable robust optimization
DC decomposition of nonconvex polynomials with algebraic techniques
Applications of convex optimization in signal processing and digital communication
A filtered bucket-clustering method for projection onto the simplex and the ℓ 1 ball
A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
Data-driven chance constrained stochastic program
On the structure of the solution set for the single facility location problem with average distances
A polynomial time algorithm for finding a minimum 4-partition of a submodular function
A polyhedral approach to the single row facility layout problem
On a conjecture of Dixon and other topics in variable metric methods
Uniform duality in semi-infinite convex optimization
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
Local convergence in Fermat's problem
Inexact Newton methods for the nonlinear complementarity problem
The value of the stochastic solution in stochastic linear programs with fixed recourse
A smoothing method for mathematical programs with equilibrium constraints
The generalized trust region subproblem: solution complexity and convex hull results
Global solution of semi-infinite programs
Accelerated first-order optimization under nonlinear constraints
Solving large-scale mixed-integer programs with fixed charge variables
An example of a nonregular semimonotone Q -matrix
Foreword: Special Issue on Variational Analysis, Optimization, and their Applications
Some relationships between lagrangian and surrogate duality in integer programming
The mixed vertex packing problem
Perspective cuts for a class of convex 0-1 mixed integer programs
A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
Geometry of optimality conditions and constraint qualifications
Forest covers and a polyhedral intersection theorem
Duality in infinite dimensional linear programming
Tight formulations for some simple mixed integer programs and convex objective integer programs
A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
Mixed-integer optimal control problems with switching costs: a shortest path approach
Better-than-$\frac{4}{3}$-approximations for leaf-to-leaf tree and connectivity augmentation
A projective method for structured nonlinear programs
New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
Compactness and convergence rates in the combinatorial integral approximation decomposition
The hirsch conjecture is true for (0, 1)-polytopes
The geometry of SDP-exactness in quadratic optimization
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
A faster strongly polynomial time algorithm for submodular function minimization
Solving a real-world train-unit assignment problem
Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing
A characterization of ill-posed data instances for convex programming
New characterizations of Hoffman constants for systems of linear constraints
Implementable tensor methods in unconstrained convex optimization
Solving large-scale minimax problems with the primal-dual steepest descent algorithm
Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
Subsmooth semi-infinite and infinite optimization problems
A note on perfect duality and limiting lagrangeans
Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
Cut sharing for multistage stochastic linear programs with interstage dependency
Near-optimal stochastic approximation for online principal component estimation
Set intersection problems: supporting hyperplanes and quadratic programming
Structural properties and recognition of restricted and strongly unimodular matrices
Capacitated transit assignment with loading priorities
New extremal principles with applications to stochastic and semi-infinite programming
A limited memory steepest descent method
On affine scaling algorithms for nonconvex quadratic programming
Staircase transportation problems with superadditive rewards and cumulative capacities
An active set method for solving linearly constrained nonsmooth optimization problems
A critical index algorithm for nearest point problems on simplicial cones
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
Comments on the note of Frieze
Second-order necessary and sufficient conditions in nonsmooth optimization
Computation of the maximum likelihood estimator in low-rank factor analysis
Run-and-Inspect Method for nonconvex optimization and global optimality bounds for R-local minimizers
Seizure warning algorithm based on optimization and nonlinear dynamics
A modified lift-and-project procedure
Convergence rates of a global optimization algorithm
Convergence rates with inexact non-expansive operators
New lower bounds on crossing numbers of K m,n from semidefinite programming
Approximate extended formulations
A pessimistic bilevel stochastic problem for elastic shape optimization
Smoothed analysis of integer programming
A new method for a class of linear variational inequalities
Worst-case analyses, linear programming and the bin-packing problem
A globally convergent version of the Polak-Ribière conjugate gradient method
Degeneracy in the multi-source Weber problem
Efficient and fair routing for mesh networks
Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
Multiflows and disjoint paths of minimum total cost
A preconditioned iterative interior point approach to the conic bundle subproblem
On the geometric structure of independence systems
On the equivalence of some generalized network problems to pure network problems
The boolean quadric polytope: Some characteristics, facets and relatives
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
An algorithm for the 0/1 Knapsack problem
Convex analysis in groups and semigroups: a sampler
Variational analysis of convexly generated spectral max functions
On the 0, 1 facets of the set covering polytope
Nominations for 1988 elections
Gradient regularization of Newton method with Bregman distances
Mixed-integer quadratic programming
Newton methods for nonsmooth convex minimization: connections among U-Lagrangian, Riemannian Newton and SQP methods
Improved approximation algorithms for hitting 3-vertex paths
Nonlinear error bounds for lower semicontinuous functions on metric spaces
Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk
Application of sequential quadratic programming software program to an actual problem
Multiplicative updates for symmetric-cone factorizations
Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions
A solvable case of the traveling salesman problem
Euclidean semi-matchings of random samples
Maximum a posteriori estimators as a limit of Bayes estimators
An interior-point method for generalized linear-fractional programming
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
Computing the conjugate of convex piecewise linear-quadratic bivariate functions
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
Two "well-known" properties of subgradient optimization
Convex envelopes for edge-concave functions
Riemannian trust-region methods for strict saddle functions with complexity guarantees
On the adaptivity gap in two-stage robust linear optimization under uncertain packing constraints
Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
Convergence in distribution of randomized algorithms: the case of partially separable optimization
On Balanced Graphs
Convex analysis and financial equilibrium
Convergence properties of relaxation algorithms
Tropical medians by transportation
Global minimization using an Augmented Lagrangian method with variable lower-level constraints
A cost function property for plant location problems
Formulating an objective for an economy
A new ILP-based refinement heuristic for Vehicle Routing Problems
Sequence independent lifting for mixed knapsack problems with GUB constraints
A duality theorem for semi-infinite convex programs and their finite subprograms
Copositivity detection by difference-of-convex decomposition and ω-subdivision
Adaptive Sampling line search for local stochastic optimization with integer variables
Local convergence of quasi-Newton methods for B-differentiable equations
Computing a global optimal solution to a design centering problem
Speeding up Karmarkar's algorithm for multicommodity flows
Optimizing over the split closure
A note about sparsity exploiting quasi-Newton updates
Quasidifferentials and maximal normal operators
Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints
Ky Fan's N-matrices and linear complementarity problems
Convex sweeping process in the framework of measure differential inclusions and evolution variational inequalities
On distributionally robust chance constrained programs with Wasserstein distance
A strongly polynomial algorithm for linear systems having a binary solution
Multi-item lot-sizing with joint set-up costs
Extended formulations, nonnegative factorizations, and randomized communication protocols
Roof duality, complementation and persistency in quadratic 0-1 optimization
On the acyclic subgraph polytope
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel Balinski
Computational study of a family of mixed-integer quadratic programming problems
A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming bases
Persistency of linear programming relaxations for the stable set problem
An improved rounding method and semidefinite programming relaxation for graph partition
Facets of the balanced (acyclic) induced subgraph polytope
Strongly stable C-stationary points for mathematical programs with complementarity constraints
Discretization in semi-infinite programming: the rate of convergence
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
Abstract polytopes and the hirsch conjecture
Sparse solutions of linear complementarity problems
Piecewise affine parameterized value-function based bilevel non-cooperative games
A general descent framework for the monotone variational inequality problem
A unification of two classes of Q -matrices
Martin Beale memorial symposium
A note on solution of large sparse maximum entropy problems with linear equality constraints
A regularized decomposition method for minimizing a sum of polyhedral functions
Symmetric sums of squares over k-subset hypercubes
On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
Revenue maximization in Stackelberg Pricing Games: beyond the combinatorial setting
Implicit representation of generalized variable upper bounds in linear programming
From differential equation solvers to accelerated first-order methods for convex optimization
Minimum principle sufficiency
Integral approximation sequences
Scenario reduction in stochastic programming
Convergence analysis of stationary points in sample average approximation of stochastic programs with second order stochastic dominance constraints
In memory of Tjalling C. Koopmans
Maximizing the minimum source-sink path subject to a budget constraint
A combinatorial interior point method for network flow problems
Structural properties of affine sparsity constraints
Erratum to: Risk-averse dynamic programming for Markov decision processes
Two-commodity cut-packing problem
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
Constant factor approximation for ATSP with two edge weights
Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs
A matrix generation approach for eigenvalue optimization
Semidefinite representations for finite varieties
Distributionally robust joint chance constraints with second-order moment information
Projected gradient methods for linearly constrained problems
Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes Q and Q 0
A model and approach to the challenge posed by optimal power systems planning
Primal convergence from dual subgradient methods for convex optimization
A note on Robinson-Ursescu and Lyusternik-Graves theorem
Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
Valid inequalities for separable concave constraints with indicator variables
On sparsity of the solution to a random quadratic optimization problem
A first-order interior-point method for linearly constrained smooth optimization
The Steiner tree polytope and related polyhedra
Packing Steiner trees: a cutting plane algorithm and computational results
On cardinality constrained cycle and path polytopes
Computing optimal preemptive schedules for parallel tasks: linear programming approaches
A polyhedral approach to the alldifferent system
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
Gradient methods for minimizing composite functions
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
Sample-path solution of stochastic variational inequalities
Factorization and cutting planes for completely positive matrices by copositive projection
Online algorithms: a survey
Decomposition of loosely coupled integer programs: a multiobjective perspective
The 0-1 Knapsack problem with a single continuous variable
Some results on the strength of relaxations of multilinear functions
A finite characterization of K -matrices in dimensions less than four
On solving a primal geometric program by partial dual optimization
A constructive proof of a permutation-based generalization of Sperner's lemma
Model assessment objectives in or
Network strength games: the core and the nucleolus
Nonsingularity and symmetry for linear normal maps
How to make a graph four-connected
A primal-dual potential reduction method for problems involving matrix inequalities
On optimizing certain nonlinear convex functions which are partially defined by a simulation process
On two homogeneous self-dual approaches to linear programming and its extensions
Error Bounds for Nondegenerate Monotone Linear Complementarity Problems
On the extreme inequalities of infinite group problems
Global optimization problems and domain reduction strategies
Two applications of the Divide&Conquer principle in the molecular sciences
The master equality polyhedron with multiple rows
Second-order conditions for an exact penalty function
The rank of (mixed-) integer polyhedra
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
Various definitions of the derivative in mathematical programming - an addendum
Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
An asynchronous parallel newton method
Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
A path to the Arrow-Debreu competitive market equilibrium
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
Ideal, non-extended formulations for disjunctive constraints admitting a network representation
Improvements of the Held - Karp algorithm for the symmetric traveling-salesman problem
Strong mixed-integer programming formulations for trained neural networks
Global saddle-point duality for quasi-concave programs, II
Convex quadratic programming with one constraint and bounded variables
An associated maximization problem for two-person nonzero-sum separable games
On generalizations of network design problems with degree bounds
Robust flows over time: models and complexity results
Multilevel least-change Newton-like methods for equality constrained optimization problems
Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
Proximity Control in Bundle Methods for Convex Nondifferentiable Minimization
Approximating disjoint-path problems using packing integer programs
The K-moment problem with densities
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes
Convergence rates of the Heavy-Ball method under the Łojasiewicz property
Least-change quasi-Newton updates for equality-constrained optimization
Simple odd β-cycle inequalities for binary polynomial optimization
Optimal electric power scheduling: A large nonlinear programming test problem solved by recursive quadratic programming
Correction to: On the pervasiveness of difference-convexity in optimization and statistics
A fast and robust unconstrained optimization method requiring minimum storage
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem
On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methods
A note on a sufficient-decrease criterion for a non-derivative step-length procedure
An Algorithm for a Singly Constrained Class of Quadratic Programs Subject to Upper and Lower Bounds
Calculating surrogate constraints
Optimality conditions in convex multiobjective SIP
A Probabilistic Analysis of the Multiknapsack Value Function
Newton's method for generalized equations: a sequential implicit function theorem
Set Intersection Theorems and Existence of Optimal Solutions
Shortest paths algorithms: Theory and experimental evaluation
Optimal error bounds for non-expansive fixed-point iterations in normed spaces
Box-total dual integrality, box-integrality, and equimodular matrices
Dynamic flows with adaptive route choice
An implementable proximal point algorithmic framework for nuclear norm minimization
An algorithm for nonconvex programming problems
Second order analysis of control-affine problems with scalar state constraint
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
Polyhedral aspects of feedback vertex set and pseudoforest deletion set
New geometry-inspired relaxations and algorithms for the metric Steiner tree problem
Quasi Newton techniques generate identical points II: The proofs of four new theorems
A tractable multi-leader multi-follower peak-load-pricing model with strategic interaction
Random approximations in multiobjective optimization
Decomposition methods in stochastic programming
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
Computational complexity of stochastic programming problems
Lipschitz-like property relative to a set and the generalized Mordukhovich criterion
Coverings and structure of crossing families
On the history of the transportation and maximum flow problems
Degenerate complementary cones induced by a K 0 -matrix
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
Strong formulations for quadratic optimization with M-matrices and indicator variables
Trivial integer programs unsolvable by branch-and-bound
New limits of treewidth-based tractability in optimization
First-order methods of smooth convex optimization with inexact oracle
Sufficiency of cut-generating functions
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
Facets for the cut cone II: Clique-web inequalities
A .699-approximation algorithm for Max-Bisection
A quadratically-convergent algorithm for general nonlinear programming problems
Unconstrained optimization based on homogeneous models
Parametric linear programming and anti-cycling pivoting rules
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual