yusuke1997/dblp-id-title huggingface dataset:
Characterizing an optimal input in perturbed convex programming
An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
The Braess paradox
Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming
Universal duality in conic convex optimization
On a generalization of the master cyclic group polyhedron
The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
Scalar labelings for homotopy paths
On the cost of computing roots of polynomials
On the bilinearity rank of a proper cone and Lyapunov-like transformations
Simulation-based confidence bounds for two-stage stochastic programs
First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials
LP-based approximation algorithms for capacitated facility location
On the local stability of semidefinite relaxations
A linear programming formulation for the maximum complete multipartite subgraph problem
A note on linear complementarity problems and multiple objective programming
Convex composite multi-objective nonsmooth programming
A warm-start approach for large-scale stochastic linear programs
Nested decomposition for dynamic models
Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction
Non-convex exact community recovery in stochastic block model
An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions
NE/SQP: A robust algorithm for the nonlinear complementarity problem
A new warmstarting strategy for the primal-dual column generation method
Moreau's decomposition in Banach spaces
On the implementation and strengthening of intersection cuts for QCQPs
A linear algorithm for integer programming in the plane
The assignment polytope
Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier
Complexity of stochastic dual dynamic programming
Superlinear primal-dual affine scaling algorithms for LCP
A scaling algorithm for optimizing arbitrary functions over vertices of polytopes
Global optima results for the Kauffman NK model
Coordinated cutting plane generation via multi-objective separation
An extreme function which is nonnegative and discontinuous everywhere
Linear conic formulations for two-party correlations and values of nonlocal games
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Second-order conditions in C 1, 1 constrained vector optimization
Metrics and undirected cuts
Tight MIP formulations for bounded up/down times and interval-dependent start-ups
Multiobjective optimization problems with equilibrium constraints
Edge-augmentation of hypergraphs
A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models
Bounding multi-stage stochastic programs from above
Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem
On search directions for minimization algorithms
Parametric approaches to fractional programs
On the integrality gap of binary integer programs with Gaussian data
On a special class of regularized central paths for semidefinite programs
A copositive Q-matrix which is no R 0
Non-Interior continuation methods for solving semidefinite complementarity problems
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
Using Gale transforms in computational geometry
A connection between cutting plane theory and the geometry of numbers
Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
Two algorithms for weighted matroid intersection
Extended formulations for binary optimal control problems
Chain rules for linear openness in metric spaces and applications
Improved complexity results on solving real-number linear feasibility problems
Characterization theorems for stochastic programs
Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity
Bulk-Robust combinatorial optimization
Linear convergence of first order methods for non-strongly convex optimization
The level set method of Joó and its use in minimax theory
On the asymptotic behaviour of some new gradient methods
Nonnegative rank depends on the field
Optimality conditions for maximizing a function over a polyhedron
Bi-perspective functions for mixed-integer fractional programs with indicator variables
An interior point method with Bregman functions for the variational inequality problem with paramonotone operators
On the dominant of the s - t -cut polytope: Vertices, facets, and adjacency
Nonsmooth analysis of eigenvalues
On intersection of two mixing sets with applications to joint chance-constrained programs
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
A coupled column generation, mixed integer approach to optimal planning of intensity modulated radiation therapy for cancer
A simple LP relaxation for the asymmetric traveling salesman problem
A rapidly convergent five-point algorithm for univariate minimization
A stochastic programming model using an endogenously determined worst case risk measure for dynamic asset allocation
Some new results regarding spikes and a heuristic for spike construction
Informationally optimal correlation
Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods
Axiomatic approach to statistical models and their use in multimodal optimization theory
Affirmative action algorithms
A practical general approximation criterion for methods of multipliers based on Bregman distances
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation
Optimal crashing of an activity network with disruptions
Optimality condition: Constraint regularization
A computational study of graph partitioning
Matrix factorizations in optimization of nonlinear functions subject to linear constraints - an addendum
Invariance and efficiency of convex representations
On the geometry and refined rate of primal-dual hybrid gradient for linear programming
Efficient group cuts for integer programs
An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems
On a property of polyhedral sets
Modified orbital branching for structured symmetry with an application to unit commitment
On the number of solutions to the linear comple-mentarity problem
Iterative hard thresholding methods for l 0 regularized convex cone programming
Asymptotic constraint qualifications and global error bounds for convex inequalities
Improved approximations for cubic bipartite and cubic TSP
Selected topics in robust convex optimization
Improved approximation algorithms for capacitated facility location problems
Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
On rates of convergence and asymptotic normality in the multiknapsack problem
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
European assembly constituencies for wales - comparing of methods for solving a political districting problem
Mathematical programming study 21 - Sensitivity, Stability and parametric analysis
Optimization of lipschitz continuous functions
Safe and tight linear estimators for global optimization
Weber's problem and weiszfeld's algorithm in general spaces
Generating and measuring instances of hard semidefinite programs
Convergence of the preconditioned proximal point method and Douglas-Rachford splitting in the absence of monotonicity
The C 3 Theorem and a D 2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification
The long-step method of analytic centers for fractional problems
Efficient joint object matching via linear programming
Totally unimodular stochastic programs
The Steiner tree problem I: Formulations, compositions and extension of facets
On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
Entropic proximal decomposition methods for convex programs and variational inequalities
Generalized pattern searches with derivative information
Composition duality and maximal monotonicity
How to convexify the intersection of a second order cone and a nonconvex quadratic
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice
A lower bound on the barrier parameter of barriers for convex cones
How to deal with the unbounded in optimization: Theory and algorithms
A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization
A note on the convergence of an algorithm for nonconvex programming problems
On Fan's minimax theorem
Tight integral duality gap in the Chinese Postman problem
Maximum stable set formulations and heuristics based on continuous optimization
Design of planar articulated mechanisms using branch and bound
Practical convergence conditions for the Davidon-Fletcher-Powell method
Optimal labeling of point features in rectangular labeling models
A cutting plane algorithm for the windy postman problem
Sample average approximation with heavier tails II: localization in stochastic convex optimization and persistence results for the Lasso
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid
The uncapacitated lot-sizing problem with sales and safety stocks
Valid inequalities for mixed integer linear programs
An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
Solving second-order conic systems with variable precision
On the limited memory BFGS method for large scale optimization
Modified Cholesky algorithms: a catalog with new approaches
On the refinement of bounds of heuristic algorithms for the traveling salesman problem
Maximization of AUC and Buffered AUC in binary classification
The eclectic primal algorithm: Cutting-plane method that accommodates hybrid subproblem solution techniques
Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
A practical anti-cycling procedure for linearly constrained optimization
Faster subgradient methods for functions with Hölderian growth
Zeroth-order optimization with orthogonal random directions
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
Improved algorithm for mixed-integer quadratic programs and a computational study
Correction to: The ancestral Benders' cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming
Scalable adaptive cubic regularization methods
Wait-and-judge scenario optimization
Packing Steiner trees: polyhedral investigations
On the refinement of bounds of heuristics algorithms of the traveling salesman poblem
Dual bounding procedures lead to convergent Branch-and-Bound algorithms
Dyadic linear programming and extensions
Bounded knapsack sharing
New analysis of linear convergence of gradient-type methods via unifying error bound conditions
An exact penalty function method with global convergence properties for nonlinear programming problems
On convergence rates of subgradient optimization methods
Thresholded covering algorithms for robust and max-min optimization
Perturbation analysis of second-order cone programming problems
Relaxation-based algorithms for minimax optimization problems with resource allocation applications
Convex approximations for complete integer recourse models
Searching for critical angles in a convex cone
Implicit solution function of P 0 and Z matrix linear complementarity constraints
Cyclic group blocking polyhedra
A simplex algorithm for rational cp-factorization
Avoiding numerical cancellation in the interior point method for solving semidefinite programs
Paths on polymatroids
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
Penalty functions in ε-programming and ε-minimax problems
Recognizing pinch-graphic matroids
Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
A differentiable homotopy method to compute perfect equilibria
Normal conical algorithm for concave minimization over polytopes
Lyapunov stability of the subgradient method with constant step size
A polynomial case of unconstrained zero-one quadratic optimization
A dual differentiable exact penalty function
Convergence Properties of Trust Region Methods for Linear and Convex Constraints
The Fermat rule for multifunctions on Banach spaces
Computing nonlinear network equilibria
Reminiscences on the development of the variational approach to Davidon's variable-metric method
Optimal schedule for cancer chemotherapy
An improved disaggregation method for transportation problems
Variable metric relaxation methods, part II: The ellipsoid method
New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
The integer approximation error in mixed-integer optimal control
New algorithms for maximum disjoint paths based on tree-likeness
Accelerated stochastic approximation with state-dependent noise
A polyhedral study of the semi-continuous knapsack problem
A Primal Simplex Algorithm that Solves the Maximum Flow Problem in at most nm Pivots and O(n 2 m) Time
An algorithm for solving convex programs with an additional convex-concave constraint
Global one-dimensional optimization using smooth auxiliary functions
Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
Robust optimization - methodology and applications
An extension of Chubanov's algorithm to symmetric cones
On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
Neural spectrahedra and semidefinite lifts: global convex optimization of degree-two polynomial activation neural networks in polynomial-time
Tame functions are semismooth
On the superlinear convergence of a trust region algorithm for nonsmooth optimization
Convexification of generalized network flow problem
On the rate of convergence of sequential quadratic programming with nondifferentiable exact penalty function in the presence of constraint degeneracy
Traces of the XII Aussois Workshop on Combinatorial Optimization
On the gap between the quadratic integer programming problem and its semidefinite relaxation
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
Non-Zenoness of a class of differential quasi-variational inequalities
A 1-(S, T)-edge-connectivity augmentation algorithm
Decomposing symmetric exchanges in matroid bases
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
Approximate min-max relations for odd cycles in planar graphs
On the basic theorem of complementarity
A note on the solution of bilinear programming problems by reduction to concave minimization
Projection results for vehicle routing
From error bounds to the complexity of first-order descent methods for convex functions
A projection-free method for solving convex bilevel optimization problems
Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
Spectral risk measures: the risk quadrangle and optimal approximation
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
Convex duality in optimal investment under illiquidity
Location and shape of a rectangular facility in Real n Convexity properties
Exploiting symmetry in copositive programs via semidefinite hierarchies
Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization
Risk averse elastic shape optimization with parametrized fine scale geometry
Optimality, identifiability, and sensitivity
Partitioned matching games for international kidney exchange
The pin redistribution problem in multi-chip modules
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Scalable subspace methods for derivative-free nonlinear least-squares optimization
Computational aspects of relaxation complexity: possibilities and limitations
Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
A maximum b-matching problem arising from median location models with applications to the roommates problem
Solution dependence on initial conditions in differential variational inequalities
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
Data-driven inverse optimization with imperfect information
On Differential Stability in Stochastic Programming
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
On the generation of all equilibrium points for bimatrix games through the Lemke - Howson Algorithm
A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
Sublinear upper bounds for stochastic programs with recourse
Feasible descent algorithms for mixed complementarity problems
Sparse optimization on measures with over-parameterized gradient descent
Distribution sensitivity in stochastic programming
Regularization using a parameterized trust region subproblem
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems
A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
The duality of option investment strategies for hedge funds
A parametric simplex algorithm for linear vector optimization problems
Stochastic global optimization methods part II: Multi level methods
On the convergence of the Weiszfeld algorithm
A modification of Armijo's step-size rule for negative curvature
Edmonds polytopes and weakly hamiltonian graphs
An algorithm for linear least squares problems with equality and nonnegativity constraints
Sensitivity Analysis Based Heuristic Algorithms for Mathematical Programs with Variational Inequality Constraints
Least-index resolution of degeneracy in quadratic programming
A constraint generation algorithm for large scale linear programs using multiple-points separation
A simplex algorithm for piecewise-linear programming III: Computational analysis and applications
On the discovery of the "good Broyden" method
A simulation tool for the performance evaluation of parallel branch and bound algorithms
Duality in disjunctive programming via vector optimization
Residuals-based distributionally robust optimization with covariate information
Computability of global solutions to factorable nonconvex programs: Part I - Convex underestimating problems
Submodular linear programs on forests
Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
On a characterization of P-matrices
Riemannian Optimization via Frank-Wolfe Methods
On the augmented Lagrangian dual for integer programming
Matching, Euler tours and the Chinese postman
A variant of Karmarkar's linear programming algorithm for problems in standard form
Minimizing symmetric submodular functions
Quadratic convergence of potential-reduction methods for degenerate problems
Graphs with G p -connected medians
Combined phase I - phase II methods of feasible directions
Computing the radius of pointedness of a convex cone
Inapproximability of shortest paths on perfect matching polytopes
New characterizations of strategy-proofness under single-peakedness
A combined phase I-phase II scaled potential algorithm for linear programming
Worst-case analysis of the differencing method for the partition problem
Newton's iterates can converge to non-stationary points
A bundle method for solving equilibrium problems
Mixing polyhedra with two non divisible coefficients
Convex hulls of monomial curves, and a sparse positivstellensatz
Directional differentiability of the optimal value function in convex semi-infinite programming
Minimizing Polynomials via Sum of Squares over the Gradient Ideal
A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
A note on an approximate lagrange multiplier rule
Interior-point algorithms for semi-infinite programming
Legendre-type optimality conditions for a variational problem with inequality state constraints
Min-max-min robust combinatorial optimization
Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems
On the k-cut subgraph polytope
On the existence and uniqueness of solutions in nonlinear complementarity theory
A note on polylinking flow networks
A variable-penalty alternating directions method for convex optimization
Second-order global optimality conditions for convex composite optimization
A Gaussian upper bound for Gaussian multi-stage stochastic linear programs
Graphic matroids and the multicommodity transportation problem
Data perturbations in stochastic generalized equations: statistical robustness in static and sample average approximated models
Nonsmooth optimization via quasi-Newton methods
On the natural merit function for solving complementarity problems
Scheduling jobs of equal length: compleixty, facets and computational results
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
Approximation algorithms for inventory problems with submodular or routing costs
A 3-Slope Theorem for the infinite relaxation in the plane
A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
Strong formulations for mixed integer programming: A survey
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard
Coordinatewise domain scaling algorithm for M-convex function minimization
Volumetric path following algorithms for linear programming
Duality gaps in semi-infinite linear programming - an approximation problem
Optimizing distortion riskmetrics with distributional uncertainty
A mathematical programming approach for determining oligopolistic market equilibrium
A combined phase I-phase II projective algorithm for linear programming
A linear assignment approach for the least-squares protein morphing problem
A primal-dual algorithm for risk minimization
An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy
Learning in games with continuous action sets and unknown payoff functions
Generation of all integer points for given sets of linear inequalities
A new technique for generating quadratic programming test problems
Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality
Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems
Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
Distributed multi-agent optimization with state-dependent communication
Correction to: A scaling algorithm for optimizing arbitrary functions over vertices of polytopes
A convergence analysis of the price of anarchy in atomic congestion games
On the performance of affine policies for two-stage adaptive optimization: a geometric perspective
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
Network design problem with congestion effects: A case of bilevel programming
Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
Dual coordinate ascent methods for non-strictly convex minimization
Convex generalized Nash equilibrium problems and polynomial optimization
Integer programming duality: Price functions and sensitivity analysis