yusuke1997/dblp-id-title huggingface dataset:
A greedy algorithm for solving a certain class of linear programmes
Nonlinear rescaling vs. smoothing technique in convex optimization
The GUS-property of second-order cone linear complementarity problems
Duality and martingales: a stochastic programming perspective on contingent claims
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
Completely positive reformulations for polynomial optimization
On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
A method of projection onto an acute cone with level control in convex minimization
Smoothed analysis of termination of linear programming algorithms
An approximation algorithm for indefinite mixed integer quadratic programming
Optimal partitions having disjoint convex and conic hulls
On cycling in the network simplex method
Improved approximation algorithms for two variants of the stable marriage problem with ties
Use of dynamic trees in a network simplex algorithm for the maximum flow problem
QN-like variable storage conjugate gradients
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
A capacity scaling algorithm for convex cost submodular flows
Progressive global random search of continuous functions
An exponential lower bound for Cunningham's rule
Bidimensional packing by bilinear programming
Copositivity and constrained fractional quadratic problems
Facets of the linear ordering polytope
Random variables, monotone relations, and convex analysis
Solving graph equipartition SDPs on an algebraic variety
Minimization of a quasi-concave function over an efficient set
On quantile cuts and their closure for chance constrained optimization problems
Statistical robustness in utility preference robust optimization models
On monotonicity in parametric linear complementarity problems
Performance evaluation of nonlinear optimization methods via pairwise comparison and fuzzy numbers
Optimization problems with equilibrium constraints and their numerical solution
Necessary optimality conditions for constrained optimization problems under relaxed constraint qualifications
Unification of basic and composite nondifferentiable optimization
Stronger linear programming relaxations of max-cut
Hyperbolic set covering problems with competing ground-set elements
Optimality conditions in mathematical programming and composite optimization
Computational aspects of cutting-plane algorithms for geometric programming problems
Branching on general disjunctions
The salesman's improved tours for fundamental classes
An extension of the edge covering problem
Symmetry-breaking inequalities for ILP with structured sub-symmetry
Approximation algorithms for supply chain planning and logistics problems with market choice
Sample complexity analysis for adaptive optimization algorithms with stochastic oracles
The inverse optimal value problem
Accelerated first-order methods for a class of semidefinite programs
Iterative methods for variational and complementarity problems
On some properties and an application of the logarithmic barrier method
On the convergence of Newton iterations to non-stationary points
Blocking and antiblocking sets
Transmission system repair and restoration
Computational results on an algorithm for finding all vertices of a polytope
Polyhedral study of the capacitated vehicle routing problem
When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent?
Lifts of convex sets in optimization
Solution of large-scale symmetric travelling salesman problems
A note on strong perfectness of graphs
On the expected number of linear complementarity cones intersected by random and semi-random rays
A capacity scaling algorithm for M-convex submodular flow
Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
Linear programming using limited-precision oracles
Liquidity risks on power exchanges: a generalized Nash equilibrium model
An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
Maximal quasimonotonicity and dense single-directional properties of quasimonotone operators
Pseudomonotone variational inequality problems: Existence of solutions
The price of Anarchy in series-parallel network congestion games
The mixing-MIR set with divisible capacities
Linear inequalities, mathematical programming and matrix theory
Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems
Ergodic, primal convergence in dual subgradient schemes for convex programming, II: the case of inconsistent primal problems
Sparsity penalized mean-variance portfolio selection: analysis and computation
Bayesian stopping rules for multistart global optimization methods
An unbounded Sum-of-Squares hierarchy integrality gap for a polynomially solvable problem
First- and second-order high probability complexity bounds for trust-region methods with noisy oracles
A family of variable metric updates
A fixed-point iteration approach for multibody dynamics with contact and small friction
On the complexity of a class of combinatorial optimization problems with uncertainty
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
An inexact bundle variant suited to column generation
A tolerant algorithm for linearly constrained optimization calculations
Pure adaptive search for finite global optimization
On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method
An interior point algorithm for semi-infinite linear programming
Sample size selection in optimization methods for machine learning
Exact and inexact penalty methods for the generalized bilevel programming problem
Assigning sporadic tasks to unrelated machines
A new bound for the ratio between the 2-matching problem and its linear programming relaxation
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring
(1, k )-configurations and facets for packing problems
Classes of functions and feasibility conditions in nonlinear complementarity problems
Two-stage stochastic programming under multivariate risk constraints with an application to humanitarian relief network design
A generalization of antiwebs to independence systems and their canonical facets
The influence curve approach in data envelopment analysis
A stable method for solving certain constrained least squares problems
A hierarchical algorithm for making sparse matrices sparser
The computation of Lagrange-multiplier estimates for constrained minimization
Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
A globally convergent incremental Newton method
Theory of semidefinite programming for Sensor Network Localization
Improved global guarantees for the nonconvex Burer-Monteiro factorization via rank overparameterization
Implementation of a continuation method for normal maps
Survivable networks, linear programming relaxations and the parsimonious property
The general quadratic optimization problem
Trace ratio optimization with an application to multi-view learning
An analytic center quadratic cut method for the convex quadratic feasibility problem
A feasible semismooth asymptotically Newton method for mixed complementarity problems
A unified approach to global convergence of trust region methods for nonsmooth optimization
Finding the t -join structure of graphs
Improving the rate of convergence of interior point methods for linear programming
On cutting planes for cardinality-constrained linear programs
On the separation of disjunctive cuts
Successive edge-connectivity augmentation problems
An approach to integer programming
Solving staircase linear programs by the simplex method, 2: Pricing
Stabilizing network bargaining games by blocking players
A stabilized structured Dantzig-Wolfe decomposition method
A note on the computation of an orthonormal basis for the null space of a matrix
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
On the existence of convex decompositions of partially separable functions
Representative functions of maximally monotone operators and bifunctions
Degeneracy in infinite horizon optimization
A new strongly polynomial dual network simplex algorithm
Separation algorithms for 0-1 knapsack polytopes
Asymptotic analysis of the exponential penalty trajectory in linear programming
Cuts, matrix completions and graph rigidity
Truthful mechanism design via correlated tree rounding
Dynamic linear programming games with risk-averse players
Transversal matroid intersections and related packings
Maximal monotonicity criteria for the composition and the sum under weak interiority conditions
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization
On implementing a primal-dual interior-point method for conic quadratic optimization
Optimal stopping, exponential utility, and linear programming
Solution Differentiability for Variational Inequalities
An improved column generation algorithm for minimum sum-of-squares clustering
A note on alternating projections for ill-posed semidefinite feasibility problems
Finding efficient points for linear multiple objective programs
Correlation polytopes: Their geometry and complexity
Relaxations and duality for multiobjective integer programming
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints
Special Issue: Global Solution of Integer, Stochastic and Nonconvex Optimization Problems
Solution behavior for parametric implicit complementarity problems
Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation
A branch-and-cut method for 0-1 mixed convex programming
Karmarkar's linear programming algorithm and Newton's method
Approximate fixed-rank closures of covering problems
Necessary and sufficient conditions in constrained optimization
On regular coderivatives in parametric equilibria with non-unique multipliers
On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions
The density of planar sets avoiding unit distances
An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
Distributed computation of Pareto solutions in n-player games
On second-order Fritz John type optimality conditions in nonsmooth multiobjective programming
A comment on "computational complexity of stochastic programming problems"
Variance reduction in sample approximations of stochastic programs
Clique-based facets for the precedence constrained knapsack problem
On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}
Dynamically restricted pricing in the simplex method for linear programming
Analysis of a class of fractional programming problems
Discrete optimization methods for group model selection in compressed sensing
Solving sparse principal component analysis with global support
Improved lower bounds and exact algorithm for the capacitated arc routing problem
Performance of first-order methods for smooth convex minimization: a novel approach
Radial duality part I: foundations
Global convergence of Rosen's gradient projection method
Rates of superlinear convergence for classical quasi-Newton methods
Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications
Cuts for mixed 0-1 conic programming
Optimum matching forests III: Facets of matching forest polyhedra
Lot-sizing with production and delivery time windows
QPCOMP: A quadratic programming based solver for mixed complementarity problems
Exact and approximate solutions to the multisource weber problem
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
On the minimum s-t cut problem with budget constraints
Marginal values and second-order necessary conditions for optimality
Local epi-continuity and local optimization
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Uncapacitated lot sizing with backlogging: the convex hull
The design of corporate tax structures
Merit functions in vector optimization
Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints
A note on the convergence of barrier algorithms to second-order necessary points
A superlinearly convergent method for minimization problems with linear inequality constraints
Duality gap in convex programming
Quadratic duality over convex cone domains
A note on limiting infisup theorems
The role of optimization in some recent advances in data-driven decision-making
Graph coloring and semidefinite rank
The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
Some LCPs solvable in strongly polynomial time with Lemke's algorithm
Local properties of algorithms for minimizing nonsmooth composite functions
The stable set problem and the lift-and-project ranks of graphs
Dominants and submissives of matching polyhedra
Reduction of symmetric semidefinite programs using the regular *-representation
Fitting maps of the plane to experimental data
A finite branch-and-bound algorithm for two-stage stochastic integer programs
On the Chvátal-Gomory closure of a compact convex set
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
Recent advances in the solution of quadratic assignment problems
A proximal method for composite minimization
An Efficient Algorithm for the Minimum Capacity Cut Problem
The traveling salesman problem on a graph and some related integer polyhedra
Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalization
Variational conditions with smooth constraints: structure and analysis
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
A lower bound for the controlling parameters of the exact penalty functions
Hypergraph connectivity augmentation
Sequential stopping rules for the multistart algorithm in global optimisation
Identifying effective scenarios in distributionally robust stochastic programs with total variation distance
A modified nearly exact method for solving low-rank trust region subproblem
Properties of balanced and perfect matrices
The worst case analysis of strong knapsack facets
Robust optimization of contaminant sensor placement for community water systems
Computing the nearest Euclidean distance matrix with low embedding dimensions
On matching cover of graphs
A unified exact method for solving different classes of vehicle routing problems
Various definitions of the derivative in mathematical programming
Valid inequalities based on the interpolation procedure
Some examples of cycling in variable metric methods for constrained minimization
A trust region algorithm for equality constrained optimization
Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
On the power and limitations of affine policies in two-stage adaptive optimization
Incorporating statistical model error into the calculation of acceptability prices of contingent claims
Quasi-concavity and pseudo-concavity of cubic functions
An active-set algorithm for norm constrained quadratic problems
Interior path following primal-dual algorithms. part I: Linear programming
Solving variational inequalities with monotone operators on domains given by Linear Minimization Oracles
Minimizing average completion time in the presence of release dates
A barrier function method for minimax problems
Stochastic dual dynamic integer programming
The best parameter subset using the Chebychev curve fitting criterion
An exact penalty function for nonlinear programming with inequalities
The node capacitated graph partitioning problem: A computational study
Robust multidimensional pricing: separation without regret
A QP-free constrained Newton-type method for variational inequality problems
Random projections for quadratic programs
On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
An analytical comparison of different formulations of the travelling salesman problem
Erratum: A tight formulation for uncapacitated lot-sizing with stock upper bounds
Halin graphs and the travelling salesman problem
Weakly upper Lipschitz multifunctions and applications in parametric optimization
On the convexity of the multiplicative potential and penalty functions and related topics
Characterizing an optimal input in perturbed convex programming: Corrigendum
How bad are the BFGS and DFP methods when the objective function is quadratic?
Conditioning of semidefinite programs
Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings
Characterizations of linear suboptimality for mathematical programs with equilibrium constraints
Extended convergence analysis of the Scholtes-type regularization for cardinality-constrained optimization problems
Perseus: a simple and optimal high-order method for variational inequalities
Modifications and implementation of the ellipsoid algorithm for linear programming
A non-type (D) operator in c 0
Strongly regular nonsmooth generalized equations
Inverse functions of pseudo regular mappings and regularity conditions
Submodular unsplittable flow on trees
Uncapacitated flow-based extended formulations
Correction to: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
Computational complexity of LCPs associated with positive definite symmetric matrices
Geometric and computational hardness of bilevel programming
A gentle, geometric introduction to copositive optimization
Special Issue: Global Optimization
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
A nonlinear programming approach to a very large hydroelectric system optimization
Fast convergence to non-isolated minima: four equivalent conditions for rmC 2 functions
Complementarity systems in optimization
Primal and dual active-set methods for convex quadratic programming
Submodular function minimization
A sequential homotopy method for mathematical programming problems
A family of variable metric proximal methods
On the stability of Invariant Capital Stock in a two-dimensional planning model
The travelling salesman problem and a class of polyhedra of diameter two
A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
Some NP-complete problems in quadratic and nonlinear programming
Foreword: Special issue on nonlinear programming, variational inequalities, and stochastic programming
A restart algorithm for computing fixed points without an extra dimension
On finite convergence and constraint identification of subgradient projection methods
A set intersection theorem and applications
Continuous knapsack sets with divisible capacities
On claw-free t-perfect graphs
On certain conditions for the existence of solutions of equilibrium problems
A penalized Fischer-Burmeister NCP-function
A note on solvability of a class of linear complementarity problems
Cyclic subgradient projections
Mathematical Foundations of Nonsmooth Embedding Methods
Dual coordinate step methods for linear network flow problems
A generalized subgradient method with relaxation step
Computing Karmarkar projections quickly
Optimal Jacobian accumulation is NP-complete
An infeasible interior-point algorithm for solving primal and dual geometric programs
Sensitivity theorems in integer linear programming
Nonlinear multiple objective optimization: An algorithm and some theory
Asymptotic convergence in a generalized predictor-corrector method
Optimization of the flow through networks with gains
Quantitative stability analysis of stochastic quasi-variational inequality problems and applications
Computable bounds on parametric solutions of convex problems
Risk-averse dynamic programming for Markov decision processes
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Relaxation of an optimal control problem involving a perturbed sweeping process
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
Second-order variational analysis in second-order cone programming
A scaling technique for finding the weighted analytic center of a polytope
The constrained minimum weighted sum of job completion times problem
Global optimization using random embeddings
A polynomial-time simplex method for the maximum k-flow problem
Entropy in linear programs
Approximation algorithms for combinatorial fractional programming problems
Quadratic optimization with switching variables: the convex hull for n=2
Compact representation of near-optimal integer programming solutions
Extending Scope of Robust Optimization: Comprehensive Robust Counterparts of Uncertain Problems
On the non-polynomiality of the relaxation method for systems of linear inequalities
The algebraic degree of semidefinite programming
Robustness and nondegenerateness for linear complementarity problems
The use of jacobi's lemma in unimodularity theory
A projection method for l p norm location-allocation problems
Simple examples for the failure of Newton's method with line search for strictly convex minimization
A tight (1.5+ε )-approximation for unsplittable capacitated vehicle routing on trees
A generalized complementary pivoting algorithm
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
On some balanced, totally balanced and submodular delivery games
Properties of a representation of a basis for the null space
A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming
Fenchel and Lagrange duality are equivalent
Affine-scaling for linear programs with free variables
Smallest compact formulation for the permutahedron
Some computational results of using the Ahrens - Finke method for handling degeneracy in fixed charge transportation problems
On univariate function identification problems
Flows on hypergraphs
An interior point potential reduction algorithm for the linear complementarity problem
Exterior point algorithms for nearest points and convex quadratic programs
Convex envelopes generated from finitely many compact convex sets
Uniqueness and differentiability of solutions of parametric nonlinear complementarity problems
Inclusion functions and global optimization
Unit commitment in electricity pool markets
A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
Computing pure Nash and strong equilibria in bottleneck congestion games
Distributionally robust polynomial chance-constraints under mixture ambiguity sets
Convergence of some algorithms for convex minimization
A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
A cutting plane algorithm for a clustering problem
A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering
Theoretical challenges towards cutting-plane selection
Convergence rate analysis of iteractive algorithms for solving variational inequality problems
Maximum edge-disjoint paths in planar graphs with congestion 2