yusuke1997/dblp-id-title huggingface dataset:
A Class of stochastic programs with decision dependent uncertainty
Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
A step toward probabilistic analysis of simplex method convergence
The exact worst-case convergence rate of the alternating direction method of multipliers
Four problems on graphs with excluded minors
On the facets of the mixed-integer knapsack polyhedron
Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
Rank of maximum matchings in a graph
On the best case performance of hit and run methods for detecting necessary constraints
On optimality conditions in nondifferentiable programming
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
A note on the strong polynomiality of convex quadratic programming
Product-form Cholesky factorization in interior point methods for second-order cone programming
Disjunctive cuts in Mixed-Integer Conic Optimization
An analysis of approximations for maximizing submodular set functions - I
FPT algorithms for a special block-structured integer program with applications in scheduling
Optimization over the polyhedron determined by a submodular function on a co-intersecting family
A new polynomial time method for a linear complementarity problem
Minimum cost multiflows in undirected networks
A second-order bundle method to minimize the maximum eigenvalue function
Geometry of vectorial martingale optimal transportations and duality
Nonsmooth Lyapunov pairs for differential inclusions governed by operators with nonempty interior domain
Ambiguous risk constraints with moment and unimodality information
Examples of non-convergence of conjugate descent algorithms with exact line-searches
Homotopies for computation of fixed points
Constraint classification in mathematical programming
Foreword: Special Issue on Deterministic Global Optimization and Applications
Monoidal strengthening of simple V -polyhedral disjunctive cuts
On the use of piecewise linear models in nonlinear programming
Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
A duality approach to minimax results for quasi-saddle functions in finite dimensions
Solving monotone inclusions with linear multi-step methods
Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation
On the Bartels - Golub decomposition for linear programming bases
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
Exploiting problem structure in optimization under uncertainty via online convex optimization
Broyden's method in Hilbert space
Updated triangular factors of the working basis in winkler's decomposition approach
Prophet secretary through blind strategies
On the correlation gap of matroids
Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
Eliminating extraneous edges in Greenberg's algorithm
Concurrent Stochastic Methods for Global Optimization
Small and strong formulations for unions of convex sets from the Cayley embedding
A subgradient algorithm for certain minimax and minisum problems
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
Chromatic Gallai identities operating on Lovász number
Globally convergent evolution strategies
Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity
Understanding the acceleration phenomenon via high-resolution differential equations
An Algorithm for Linear Programming which Requires O(((m+n)n 2 + (m+n) 1.5 n)L) Arithmetic Operations
The associated maximization problem for separable games
On generalized trade-off directions in nonconvex multiobjective optimization
Fair division of graphs and of tangled cakes
First-order inertial algorithms involving dry friction damping
Applications of symmetric derivatives in mathematical programming
Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
Round-robin tournaments generated by the Circle Method have maximum carry-over
An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
On implicit function theorem for locally Lipschitz equations
On approximation algorithms for concave mixed-integer quadratic programming
Balanced 0, +-1-matrixces, bicoloring and total dual integrality
More with the Lemke complementarity algorithm
Newton iterations in implicit time-stepping scheme for differential linear complementarity systems
An example of an ill-conditioned nlp problem
n-Fold integer programming in cubic time
Approximability of flow shop scheduling
Constraint aggregation for rigorous global optimization
The efficient solution of large-scale linear programming problems - some algorithmic techniques and computational results
Combinatorial algorithms for matchings, even factors and square-free 2-factors
Transient policies in discrete dynamic programming: Linear programming including suboptimality tests and additional constraints
Extremal points and optimal solutions for general capacity problems
Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
Algorithms for non-convex S n -games
Maximally monotone linear subspace extensions of monotone subspaces: explicit constructions and characterizations
A new geometric condition for Fenchel's duality in infinite dimensional spaces
Optimization methods and stability of inclusions in Banach spaces
Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping II: mean-square and linear convergence
Design and implementation of optimization software - International Summer School Organized by the Working Committee on Algorithms of the Mathematical Programming Society Sponsored by the Scientific Affairs Division of the North Atlantic Treaty Organization
Convergence bounds for nonlinear programming algorithms
Homotopies for computation of fixed points on unbounded regions
An accelerated covering relaxation algorithm for solving 0-1 positive polynomial programs
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
Efficient formulations for pricing under attraction demand models
On smoothing, regularization, and averaging in stochastic approximation methods for stochastic variational inequality problems
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(Ö nL )-iteration complexity
Continuous location under the effect of 'refraction'
Local properties of inexact methods for minimizing nonsmooth composite functions
A method for globally minimizing concave functions over convex sets
Makespan minimization in open shops: A polynomial time approximation scheme
An equivalence between two algorithms for quadratic programming
Simple extensions of polytopes
Special ordered sets and an application to gas supply operations planning
On the Windy Postman Problem on eulerian graphs
Non-convex scenario optimization
Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
Dynamic bundle methods
On cuts and matchings in planar graphs
Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
Communication-efficient algorithms for decentralized and stochastic optimization
Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
Primal and dual predicted decrease approximation methods
New scaling algorithms for the assignment and minimum mean cycle problems
Distributionally robust chance constraints for non-linear uncertainties
A Frank-Wolfe type theorem for nondegenerate polynomial programs
Objective-derivative-free methods for constrained optimization
UOBYQA: unconstrained optimization by quadratic approximation
Preprocessing for quadratic programming
Some problems in discrete optimization
Critical sets in parametric optimization
Parallel decomposition of multistage stochastic programming problems
Sharper exponential convergence rates for Sinkhorn's algorithm in continuous settings
A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
On semidefinite linear complementarity problems
Compact LP bases for a class of IP problems
State polynomials: positivity, optimization and nonlinear Bell inequalities
Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
Generalized Nash equilibrium problems and Newton methods
A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
Perturbation of error bounds
Convexity and decomposition of mean-risk stochastic programs
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
Discrete potential mean field games: duality and numerical resolution
Parametric nonlinear discrete optimization over well-described sets and matroid intersections
Partially finite convex programming, Part II: Explicit lattice models
On the core of network synthesis games
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications
Robust inversion, dimensionality reduction, and randomized sampling
Strengthening convex relaxations of 0/1-sets using Boolean formulas
A simplicial approximation of a solution for the nonlinear complementarity problem
Exact solution of network flow models with strong relaxations
Parallel machine scheduling with high multiplicity
Convergence of a generalized subgradient method for nondifferentiable convex optimization
Duality gap of the conic convex constrained optimization problems in normed spaces
Publisher Correction to: A new perspective on low-rank optimization
An alternate implementation of Goldfarb's minimization algorithm
A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
On the existence of supply function equilibria
On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
Correction: Efficient Kirszbraun extension with applications to regression
Cubic regularization of Newton method and its global performance
The zero pivot phenomenon in transportation and assignment problems and its computational implications
Mean-semideviation-based distributionally robust learning with weakly convex losses: convergence rates and finite-sample guarantees
A slope generalization of Attouch theorem
Upper Lipschitz behavior of solutions to perturbed. C 1, 1 programs
Robust sample average approximation
Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices
Concave extensions for nonlinear 0-1 maximization problems
Quartic spectrahedra
Two counterexamples on the polynomial solvability of the linear complementarity problem
A study of the difference-of-convex approach for solving linear programs with complementarity constraints
Global stability of first-order methods for coercive tame functions
Stochastic first-order methods for convex and nonconvex functional constrained optimization
Second-order characterizations of tilt stability with applications to nonlinear programming
Convex analysis treated by linear programming
Optimization algorithms and point-to-set-maps
The Projective Method for solving linear matrix inequalities
Statistical inference of semidefinite programming
LP extreme points and cuts for the fixed-charge network design problem
Linear multiple objective programs with zero-one variables
A computational study of active set strategies in nonlinear programming with linear constraints
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours
Mixing mixed-integer inequalities
An algorithm for hierarchical optimization of large-scale problems with nested structure
Feasible direction methods for stochastic programming problems
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Newton's method for constrained optimization
Enumerative inequalities in integer programming
Monotonic stable solutions for minimum coloring games
Fast deterministic approximation for the multicommodity flow problem
A dual approach for the continuous collapsing knapsack problem
A sparse proximal implementation of the LP dual active set algorithm
Lagrangean decomposition for integer nonlinear programming with linear constraints
Power optimization for connectivity problems
Computable error bounds for nonlinear programming
On the stable set polytope of a series-parallel graph
Optimization of trigonometric polynomials with crystallographic symmetry and spectral bounds for set avoiding graphs
A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
New lower bounds for the Symmetric Travelling Salesman Problem
Fitting hyperplanes by minimizing orthogonal deviations
An interior-point piecewise linear penalty method for nonlinear programming
Accelerated schemes for a class of variational inequalities
From approximate to exact integer programming
Optimization in forestry
Disjunctive programming and relaxations of polyhedra
Convexification techniques for fractional programs
Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
Robust monotone submodular function maximization
Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
Visualizing data as objects by DC (difference of convex) optimization
Ambiguous chance constrained problems and robust optimization
The computation of a general equilibrium in a public goods economy
Connected and alternating vectors: Polyhedra and algorithms
A class of methods for linear programming
Trust region affine scaling algorithms for linearly constrained convex and concave programs
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
Integrability of vector and multivector fields associated with interior point methods for linear programming
A counterexample to a conjecture of Gomory and Johnson
Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
Convergence of quasi-Newton matrices generated by the symmetric rank one update
Polyhedral Properties of the K -median Problem on a Tree
Random polytopes: Their definition, generation and aggregate properties
Benders Decomposition for Variational Inequalities
Necessary and sufficient conditions for a penalty method to be exact
New techniques for cost sharing in combinatorial optimization games
Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming
Generalized self-concordant analysis of Frank-Wolfe algorithms
Two kinds of normality in vector optimization
A trust region algorithm for minimization of locally Lipschitzian functions
Sequence independent lifting for a set of submodular maximization problems
Greedy algorithm and symmetric matroids
Constrained optimization of rank-one functions with indicator variables
Optimization via enumeration: a new algorithm for the Max Cut Problem
Level constrained first order methods for function constrained optimization
An exact algorithm for graph partitioning
A primal-dual algorithm for the fermat-weber problem involving mixed gauges
The limits of local search for weighted k-set packing
Local Minima and Convergence in Low-Rank Semidefinite Programming
Maximizing monotone submodular functions over the integer lattice
A storm of feasibility pumps for nonconvex MINLP
Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
Fractional and integral colourings
Perspective reformulations of mixed integer nonlinear programs with indicator variables
The topological structure of maximal lattice free convex bodies: The general case
A distributed one-step estimator
A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
Quasi-newton algorithms generate identical points
Superfluous matrices in linear complementarity
Unbounded convex sets for non-convex mixed-integer quadratic programming
On sample average approximation for two-stage stochastic programs without relatively complete recourse
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Efficiently solvable special cases of hard combinatorial optimization problems
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
Error bounds for infinite systems of convex inequalities without Slater's condition
A constrained min-max algorithm for rival models of the same economic system
Constructing a sequence of discrete Hessian matrices of an SC 1 function uniformly convergent to the generalized Hessian matrix
The projected faces property and polyhedral relations
An algorithm for solving linearly constrained optimization problems
Asymptotic Behaviour of Karmarkar's Method for Linear Programming
On lower bound updates in primal potential reduction methods for linear programming
Solving multiple criteria problems by interactive decomposition
Gainfree Leontief substitution flow problems
Locating tree-shaped facilities using the ordered median objective
The complementarity problem
The effect of deterministic noise in subgradient methods
Specialised versus general-purpose algorithms for minimising functions that are sums of squared terms
The polynomial hierarchy and a simple model for competitive analysis
Error Bounds of Regularized Gap Functions for Nonsmooth Variational Inequality Problems
Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions
An alternative method for a global analysis of quadratic programs in a finite number of steps
On lower iteration complexity bounds for the convex concave saddle point problems
Higher order Moreau's sweeping process: mathematical formulation and numerical simulation
Constant potential primal-dual algorithms: A framework
Facts of two Steiner arborescence polyhedra
On the extension complexity of combinatorial polytopes
Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting
Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
Critical solutions of nonlinear equations: stability issues
On some interior-point algorithms for nonconvex quadratic optimization
Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
Comment on a paper by M.C. Cheng
An 풪(n 2 log n) algorithm for the weighted stable set problem in claw-free graphs
Lifted flow cover inequalities for mixed 0-1 integer programs
Analyticity of weighted central paths and error bounds for semidefinite programming
Variance reduction for root-finding problems
On the linear convergence of the alternating direction method of multipliers
Rounding algorithms for covering problems
Stable Monotone Variational Inequalities
A procedure to rank bases by probability of being optimal using imbedded hyperspheres
A local minimax characterization for computing multiple nonsmooth saddle critical points
A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
Semidefinite programming relaxations for graph coloring and maximal clique problems
On the convergence of Han's method for convex programming with quadratic objective
A direct dual method for the mixed plant location problem with some side constraints
New metric properties for prox-regular sets
The relationship between integer and real solutions of constrained convex programming
Stochastic second-order-cone complementarity problems: expected residual minimization formulation and its applications
Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
A generalization of max flow - min cut
A variational inequality approach for the determination of oligopolistic market equilibrium
Extreme point inequalities and geometry of the rank sparsity ball
FISTA is an automatic geometrically optimized algorithm for strongly convex functions
The price of anarchy in routing games as a function of the demand
New results on Hermitian matrix rank-one decomposition
A generalized assignment problem with special ordered sets: a polyhedral approach
The maximum entropy method on the mean: Applications to linear programming and superresolution
Recognizing Balanceable Matrices
A first order method for finding minimal norm-like solutions of convex optimization problems
Inexact stochastic mirror descent for two-stage nonlinear stochastic programs
Optimizing over the subtour polytope of the travelling salesman problem
Two-stage stochastic variational inequalities: an ERM-solution procedure
An abstract model for branching and its application to mixed integer programming
Graph partitioning using linear and semidefinite programming
Asymptotic linear convergence of fully-corrective generalized conditional gradient methods
Polynomial-time algorithms for multimarginal optimal transport problems with structure
Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming
Tightening simple mixed-integer sets with guaranteed bounds
MM algorithms for geometric and signomial programming
Global minimum test problem construction
Controlled perturbations for quadratically constrained quadratic programs
A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization
On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
A stabilized SQP method: superlinear convergence
Projected Chvátal-Gomory cuts for mixed integer linear programs
Generalized Goal Programming: polynomial methods and applications
Complexity of some parametric integer and network programming problems
On perfect graphs and polyhedra with (0, 1)-valued extreme points
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Smoothed analysis of condition numbers and complexity implications for linear programming
On the core of ordered submodular cost games
A topological characterization for closed sets under polar duality in Q n
Mesh shape-quality optimization using the inverse mean-ratio metric
On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs
Exploiting special structure in a primal-dual path-following algorithm
L-shaped decomposition of two-stage stochastic programs with integer recourse
Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach
Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings
Ergodic, primal convergence in dual subgradient schemes for convex programming
An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
Vectors in a box
Sample average approximation with heavier tails I: non-asymptotic bounds with weak assumptions and stochastic constraints
MSLiP: A Computer Code for the Multistage Stochastic Linear Programming Problem