yusuke1997/dblp-id-title huggingface dataset:
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
On the number of solutions to a class of complementarity problems
Publisher Correction: Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
On area-efficient drawings of rectangular duals for VLSI floor-plan
Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry
The number of solutions of a class of linear complementarity problems
On connections between approximate second-order directional derivative and second-order Dini derivative for convex functions
Symmetric minimum-norm updates for use in gibbs free energy calculations
Minimizing the span of d -walks to compute optimum frequency assignments
Chance-constrained problems and rare events: an importance sampling approach
A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization
An axiomatic duality framework for the theta body and related convex corners
Special Issue: Continuous Optimization and Stability Analysis
Algorithms for the vector maximization problem
Long vectors for quasi-Newton updates
An application of the Lovász-Schrijver M ( K , K ) operator to the stable set problem
On the Improvement per Iteration in Karmarkar's Algorithm for Linear Programming
An efficient algorithm for minimizing barrier and penalty functions
Optimization and mechanism design
Convex optimization for the planted k-disjoint-clique problem
On Anstreicher's combined phase I-phase II projective algorithm for linear programming
Decomposition and Dynamic Cut Generation in Integer Linear Programming
On the supermodular knapsack problem
The traveling-salesman problem and minimum spanning trees: Part II
A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets
A general cone decomposition theory based on efficiency
A trust region-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
Aggregation bounds in stochastic linear programming
Intersection theorems on polytopes
Probabilistic analysis of the generalised assignment problem
Simple bounds for solutions of monotone complementarity problems and convex programs
A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods
A complementarity partition theorem for multifold conic systems
A polyhedral study of the cardinality constrained knapsack problem
Sensitivity analysis of composite piecewise smooth equations
On extremal points of quasiconvex functions
A note on "On Pareto optima, the Fermat-Weber problem, and polyhedral gauges"
An extension of Karmarkar's projective algorithm for convex quadratic programming
On strongly degenerate complementary cones and solution rays
Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
Representation for multiple right-hand sides
A polynomial-time algorithm, based on Newton's method, for linear programming
Generalized Chvátal-Gomory closures for integer programs with bounds on variables
The Steiner tree packing problem in VLSI design
Variable target value subgradient method
Modified barrier functions (theory and methods)
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
An augmented Lagrangian interior-point method using directions of negative curvature
Plane sections of simplices
Polyhedron of triangle-free simple 2-matchings in subcubic graphs
Algebraic unimodular counting
The numerical solution of Newton's problem of least resistance
George B. Dantzig: a legendary life in mathematical programming
On structures of bisubmodular polyhedra
Completely positive semidefinite rank
Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
The impact of the existence of multiple adjustable robust solutions
Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds
On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
Complexity, exactness, and rationality in polynomial optimization
Robustness of posynomial geometric programming optima
Random algorithms for convex minimization problems
Finding minimum-cost flows by double scaling
Error bounds for the aggregated convex programming problem
Unique lifting of integer variables in minimal inequalities
Solving bilevel programs with the KKT-approach
Necessary conditions for linear convergence of iterated expansive, set-valued mappings
A single cut proximal bundle method for stochastic convex composite optimization
Semi-streaming algorithms for submodular matroid intersection
Special issue: Optimization models and algorithms for data science
Integral decomposition of polyhedra and some applications in mixed integer programming
A new perspective on low-rank optimization
A unified approach to error bounds for structured convex optimization problems
Approximate Subdifferential and Metric Regularity: The Finite-Dimensional Case
Solving generalized equations via homotopies
Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
Dual versus primal-dual interior-point methods for linear and conic programming
Generalized convexity and concavity of the optimal value function in nonlinear programming
A partition-based relaxation for Steiner trees
A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy
Using regularization and second order information in outer approximation for convex MINLP
Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices
Approximate cutting planes in nonlinear programming
The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
When do birds of a feather flock together? k-Means, proximity, and conic programming
A polynomial-size extended formulation for the multilinear polytope of beta-acyclic hypergraphs
An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems
An optimal gradient method for smooth strongly convex minimization
The equivalence of strict convexity and injectivity of the gradient in bounded level sets
Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms
Matroid optimisation problems with nested non-linear monomials in the objective function
Extension of optimality conditions via supporting functions
A geometrical insight on pseudoconvexity and pseudomonotonicity
A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
Optimized Bonferroni approximations of distributionally robust joint chance constraints
Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
A hard integer program made easy by lexicography
Some convergence properties of the conjugate gradient method
A modified reduced gradient method for a class of nondifferentiable problems
A computational comparison of some non-linear programs
Optimality conditions for nonlinear semidefinite programming via squared slack variables
Simplex pivots on the set packing polytope
On the maximal flow problem with real arc capacities
Finding a low-rank basis in a matrix subspace
The two-stripe symmetric circulant TSP is in P
A new complexity metric for nonconvex rank-one generalized matrix completion
A branch-and-cut algorithm for the equicut problem
Algebraic and geometric methods in discrete optimization
Note on a sufficient condition for a local minimum of a class of nonconvex quadratic programs
Separation and relaxation for cones of quadratic forms
Multistars, partial multistars and the capacitated vehicle routing problem
New improved error bounds for the linear complementarity problem
Polyhedra for lot-sizing with Wagner-Whitin costs
A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
Strengthened semidefinite programming bounds for codes
Sub-sampled Newton methods
An approach to the numerical solutions of geometric programs
A decomposition algorithm for linear relaxation of the weighted r -covering problem
Process-based risk measures and risk-averse control of discrete-time systems
A global MINLP approach to symbolic regression
Unifying mirror descent and dual averaging
A radial basis function method for noisy global optimisation
Long-step strategies in interior-point primal-dual methods
Augmented Lagrangians in semi-infinite programming
Smooth methods of multipliers for complementarity problems
Testing copositivity with the help of difference-of-convex optimization
Tangencies and polynomial optimization
The effect of smooth parametrizations on nonconvex optimization landscapes
On convergence in mixed integer programming
Distributionally robust stochastic variational inequalities
On bar frameworks, stress matrices and semidefinite programming
Outer approximation for global optimization of mixed-integer quadratic bilevel problems
Implications of the constant rank constraint qualification
The many facets of linear programming
Multicriteria optimization with a multiobjective golden section line search
Explicit duality for convex homogeneous programs
Superlinearly convergent approximate Newton methods for LC optimization problems
A bundle Bregman proximal method for convex nondifferentiable minimization
Complementary composite minimization, small gradients in general norms, and applications
Matroids and a forest cover problem
Piecewise smooth extreme functions are piecewise linear
A note on degeneracy in linear programming
On the solitaire cone and its relationship to multi-commodity flows
New polyhedral and algorithmic results on greedoids
Tradeoff directions in multiobjective optimization problems
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
A unified approach for a 1D generalized total variation problem
On the choice of parameters for the weighting method in vector optimization
A dual ascent approach for steiner tree problems on a directed graph
A global Newton method II: Analytic centers
Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
Utility/privacy trade-off as regularized optimal transport
Applications of convex analysis within mathematics
Copositivity cuts for improving SDP bounds on the clique number
Binary clutter inequalities for integer programs
Resolvent splitting for sums of monotone operators with minimal lifting
Subgradients of marginal functions in parametric mathematical programming
Stochastic programming approach to optimization under uncertainty
Matroids and the greedy algorithm
A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
Locating the vertices of a steiner tree in an arbitrary metric space
The maximin support method: an extension of the D'Hondt method to approval-based multiwinner elections
An optimal method for stochastic composite optimization
A degeneracy exploiting LU factorization for the simplex method
Exploiting the polyhedral geometry of stochastic linear bilevel programming
Solving monotone stochastic variational inequalities and complementarity problems by progressive hedging
Testing the nullspace property using semidefinite programming
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Semidefinite programming in combinatorial optimization
On the Rational Polytopes with Chvátal Rank 1
Global convergence of the gradient method for functions definable in o-minimal structures
Theoretical and empirical analysis of trading activity
A distance constrained p-facility location problem on the real line
A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods
The integration of an interior-point cutting plane method within a branch-and-price algorithm
A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set
Correction to: Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric
Ellipsoidal mixed-integer representability
An example of cycling in a feasible point algorithm
On the smallest support size of integer solutions to linear equations
A polynomial oracle-time algorithm for convex integer minimization
A polyhedral approach to online bipartite matching
Popular edges and dominant matchings
A method of centers algorithm for certain minimax problems
Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
A technique for obtaining true approximations for k-center with covering constraints
Identification of special structure constraints in linear programs
Perturbation analysis of global error bounds for systems of linear inequalities
A new algorithm for the solution of multi-state dynamic programming problems
A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
Hidden conic quadratic representation of some nonconvex quadratic optimization problems
A polynomial cycle canceling algorithm for submodular flows
DC formulations and algorithms for sparse optimization problems
Discrete convex analysis
CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
Generalized edge packings
On the convergence of the affine-scaling algorithm
Nonlinear programming without a penalty function
A simplified view of first order methods for optimization
First-order optimization algorithms via inertial systems with Hessian driven damping
Regularization methods for optimization problems with probabilistic constraints
On the complexity of the exchange algorithm for minimax optimization problems
Bilinear optimality constraints for the cone of positive polynomials
Primal-dual subgradient methods for convex problems
Dual subgradient algorithms for large-scale nonsmooth learning problems
Convergence of relaxation algorithms by averaging
A new framework to relax composite functions in nonlinear programs
The convergence of variable metric matrices in unconstrained optimization
Restricted 2-factor polytopes
A cofferdam design optimization
SLP-IOR: An interactive model management system for stochastic linear programs
Finding all maximal efficient faces in multiobjective linear programming
Complementarity and nondegeneracy in semidefinite programming
A general double-proximal gradient algorithm for d.c. programming
Dual row modules and polyhedra of blocking group problems
A nonconvex separation property and some applications
Z-transformations on proper and symmetric cones
The static stochastic knapsack problem with normally distributed item sizes
An extension of the könig-egerváry property to node-weighted bidirected graphs
A two-stage successive overrelaxation algorithm for solving the symmetric linear complementarity problem
A unified approach to one-parametric general quadratic programming
OSGA: a fast subgradient algorithm with optimal complexity
Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
Optimality conditions for nondifferentiable convex semi-infinite programming
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
A decomposition method for MINLPs with Lipschitz continuous nonlinearities
XI. International Symposium on Mathematical Programming - August 23-27, 1982 at the University of Bonn, W. Germany
Homogenization for polynomial optimization with unbounded sets
Faster algorithms for extensive-form game solving via improved smoothing functions
Dual extrapolation and its applications to solving variational inequalities and related problems
On Patching Algorithms for Random Asymmetric Travelling Salesman Problems
An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations
A polynomial time primal network simplex algorithm for minimum cost flows
Combining and scaling descent and negative curvature directions
Exact order of Hoffman's error bounds for elliptic quadratic inequalities derived from vector-valued Chebyshev approximation
Continuous maximin knapsack problems with GLB constraints
Revisiting augmented Lagrangian duals
On L 1 and Chebyshev estimation
On conditions to have bounded multipliers in locally lipschitz programming
The partition problem
Cutting planes for integer programs with general integer variables
Stochastic programs without duality gaps
A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
Implicit multifunction theorems for the sensitivity analysis of variational conditions
On the finite convergence of interior-point algorithms for linear programming
Mixed-integer bilinear programming problems
A stochastic programming model for funding single premium deferred annuities
Sparse Kalman filtering approaches to realized covariance estimation from high frequency financial data
A semismooth equation approach to the solution of nonlinear complementarity problems
Pricing with markups in industries with increasing marginal costs
Mixed-integer sets from two rows of two adjacent simplex bases
On the worst case complexity of potential reduction algorithms for linear programming
A frequency-domain analysis of inexact gradient methods
Experiments in quadratic 0-1 programming
Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
Error bounds in mathematical programming
Approximation algorithms for two-machine flow shop scheduling with batch setup times
The Steiner connectivity problem
Pivoting to normalize a basic matrix
Robust optimal feedback for terminal linear-quadratic control problems under disturbances
Subregular recourse in nonlinear multistage stochastic optimization
On the exact separation of mixed integer knapsack cuts
A lexicographic minimax algorithm for multiperiod resource allocation
On the selection of parameters in Self Scaling Variable Metric Algorithms
Bifurcation problems in nonlinear parametric programming
An iterative scheme for variational inequalities
Epi-convergent discretizations of multistage stochastic programs via integration quadratures
Sublinear time algorithms for approximate semidefinite programming
A hybrid Newton method for solving the variational inequality problem via the D-gap function
Globally convergent limited memory bundle method for large-scale nonsmooth optimization
A quadratic programming algorithm using conjugate search directions
On partial smoothness, tilt stability and the VU -decomposition
A chordal preconditioner for large-scale optimization
Implications, conflicts, and reductions for Steiner trees
Branch-and-bound solves random binary IPs in poly(n)-time
Algorithms for flows over time with scheduling costs
Connections between semidefinite relaxations of the max-cut and stable set problems
Stackelberg risk preference design
Two-term disjunctions on the second-order cone
Reinversion with the preassigned pivot procedure
Special Issue: International Symposium on Mathematical Programming 2022
Faces for a linear inequality in 0-1 variables
Max Horn SAT and the minimum cut problem in directed hypergraphs
Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
On computing small variable disjunction branch-and-bound trees
A stability result for linear Markovian stochastic optimization problems
The complexity of approximating a nonlinear program
Random linear programs with many variables and few constraints
Modifying the BFGS update by a new column scaling technique
Stability of solutions to parameterized nonlinear complementarity problems
The equipartition polytope. I: Formulations, dimension and basic facets
A two-stage feasible directions algorithm for nonlinear constrained optimization
Total variation bounds on the expectation of periodic functions with applications to recourse approximations
Methods of conjugate directions versus quasi-Newton methods
Identifying optimal strategies in kidney exchange games is $\varSigma _2^p$-complete
A new extension of Chubanov's method to symmetric cones
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
An Exponential Example for Terlaky's Pivoting Rule for the Criss-Cross Simplex Method
Low order polynomial bounds on the expected performance of local improvement algorithms
Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
Non-asymptotic superlinear convergence of standard quasi-Newton methods
Finding and verifying the nucleolus of cooperative games
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Algorithms for nonlinear constraints that use lagrangian functions
SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
On generalizing shapley's index theory to labelled pseudomanifolds
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
A parametric linear complementarity problem involving derivatives
Separable self-concordant spectral functions and a conjecture of Tunçel
On extremal behaviors of Murty's least index method
Continuous facility location on graphs
The Manne-Chao-Wilson algorithm for computing competitive equilibria: A modified version and its implementation
Polyhedral polarity defined by a general bilinear inequality
Finite checkability for integer rounding properties in combinatorial programming problems
Weak sharp minima revisited, Part III: error bounds for differentiable convex inclusions
A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems
A reduction method for variational inequalities
MIR closures of polyhedral sets
Affinely representable lattices, stable matchings, and choice functions
Fully copositive matrices
An extended formulation of the convex recoloring problem on a tree
Approximating quadratic programming with bound and quadratic constraints
Quadratic geometric programming with application to machining economics
On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
Tight approximation bounds for maximum multi-coverage
Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function
A branch-and-cut algorithm for the maximum benefit Chinese postman problem
Solution of monotone complementarity problems with locally Lipschitzian functions
Chain-constrained spanning trees
Scalarization in vector optimization
The volumetric barrier for convex quadratic constraints
Special Issue: Topics in Stochastic Programming
A dual algorithm for the one-machine scheduling problem
A finite step algorithm via a bimatrix game to a single controller non-zero sum stochastic game
Small Chvátal Rank
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
A unified algorithm for degree bounded survivable network design