yusuke1997/dblp-id-title huggingface dataset:
Complexity of a projected Newton-CG method for optimization with bounds
Gaining or losing perspective for convex multivariate functions on box domains
Correction to: The computation of pairwise stable networks
Equilibrium computation in resource allocation games
Modeling languages and Condor: metacomputing for optimization
Incomplete oblique projections for solving large inconsistent linear systems
Convergence qualification of adaptive partition algorithms in global optimization
Subgradient ellipsoid method for nonsmooth convex problems
A non-interior continuation method for generalized linear complementarity problems
Decomposition of linear programs using parallel computation
More pathological examples for network flow problems
Packing of arborescences with matroid constraints via matroid intersection
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
Critical multipliers in variational systems via second-order generalized differentiation
An interior-point trust-funnel algorithm for nonlinear optimization
Interior point algorithms for linear programming with inequality constraints
First and second order analysis of nonlinear semidefinite programs
A graph-based decomposition method for convex quadratic optimization with indicators
Sequential location-allocation of public facilities in one- and two-dimensional space: Comparison of several policies
Generalized Gauss inequalities via semidefinite programming
On error bound moduli for locally Lipschitz and regular functions
Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse
Triangulations (tilings) and certain block triangular matrices
Validation of subgradient optimization
Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity
Boolean sublattices connected with minimization problems on matroids
Global error bounds with fractional exponents
A framework of discrete DC programming by discrete convex analysis
Scheduling uniform machines on-line requires nondecreasing speed ratios
Weak notions of nondegeneracy in nonlinear semidefinite programming
Generic properties of the complementarity problem
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Value Functions, Domination Cones and Proper Efficiency in Multicriteria Optimization
Notes on L-/M-convex functions and the separation theorems
Implicit function theorems for generalized equations
A stochastic gradient type algorithm for closed-loop problems
Mathematical programming study 31 - Computational Mathematical Programming
Optimal control for elliptic systems with pointwise euclidean norm constraints on the controls
A piecewise linear upper bound on the network recourse function
An effective branch-and-bound algorithm for convex quadratic integer programming
Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
Solving quasi-variational inequalities via their KKT conditions
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Interior projection-like methods for monotone variational inequalities
Compressing branch-and-bound trees
Representations of quasi-Newton matrices and their use in limited memory methods
An extension of Curry's theorem to steepest descent in normed linear spaces
Minmax-distance approximation and separation problems: geometrical properties
Small separations in pinch-graphic matroids
Cut search methods in integer programming
Error bounds for systems of lower semicontinuous functions in Asplund spaces
Consistent aggregation of linear complementarity problems
Least cost influence propagation in (social) networks
Polyhedral approximation in mixed-integer convex optimization
A J-symmetric quasi-newton method for minimax problems
Piecewise-linear programming: The compact (CPLP) algorithm
Robust convex optimization: A new perspective that unifies and extends
Uneven distribution of ventilation-perfusion ratios in lungs estimated by a modified Newton method
On the optimization landscape of tensor decompositions
Maximum-throughput dynamic network flows
Making sparse matrices sparser: Computational results
Strengthening the Lovász Theta(G) bound for graph coloring
Algorithms for proportional matrices in reals and integers
A flow model based on polylinking system
An exact algorithm for robust influence maximization
A note on the Frank-Tardos bi-truncation algorithm for crossing-submodular functions
Nash equilibria in the two-player kidney exchange game
$$L^{\infty }$$ L ∞ estimates on trajectories confined to a closed subset, for control systems with bounded time variation
A new algorithm for the assignment problem
Counting almost minimum cutsets with reliability applications
VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
A polyhedral study on chance constrained program with random right-hand side
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
A o( n log n ) algorithm for LP knapsacks with GUB constraints
Some computationally relevant group theoretic structures of fixed charge problems
Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
The method of successive affine reduction for nonlinear minimization
Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning
Duality theorems for certain programs involving minimum or maximum operations
An interior point algorithm to solve computationally difficult set covering problems
A polyhedral branch-and-cut approach to global optimization
Constrained composite optimization and augmented Lagrangian methods
Affine reductions for LPs and SDPs
Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
The equipartition polytope. II: Valid inequalities and facets
Stochastic binary problems with simple penalties for capacity constraints violations
Maximizing a class of submodular utility functions with constraints
An outer-approximation guided optimization approach for constrained neural network inverse problems
Distributionally robust expectation inequalities for structured distributions
On line perfect graphs
On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
Sparse sums of squares on finite abelian groups and improved semidefinite lifts
Special Issue: Polynomial and Tensor Optimization
Guaranteed clustering and biclustering via semidefinite programming
Some properties of the Hessian of the logarithmic barrier function
An introduction to a class of matrix cone programming
On "a cofferdam design optimization"
On the convergence rate of imperfect minimization algorithms in Broyden's β -class
Lipschitz and Hölder stability of optimization problems and generalized equations
A variable dimension solution approach for the general spatial price equilibrium problem
Studies in algorithmic optimization: Festschrift in Honor of William C. Davidon
Submodular maximization and its generalization through an intersection cut lens
A note on optimality conditions for the Euclidean. Multifacility location problem
On the use of intersection cuts for bilevel optimization
A coordinate gradient descent method for nonsmooth separable minimization
A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem
Binary positive semidefinite matrices and associated integer polytopes
On error bounds for lower semicontinuous functions
Polyhedral description of the integer single node flow set with constant bounds
The complexity of first-order optimization methods from a metric perspective
Matroid intersection algorithms
A trust region method for noisy unconstrained optimization
Solving Conic Systems via Projection and Rescaling
Binary extended formulations of polyhedral mixed-integer sets
Sensitivity analysis for nonsmooth generalized equations
A fundamental problem in linear inequalities with applications to the travelling salesman problem
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
Fast alternating linearization methods for minimizing the sum of two convex functions
Capacities of quantum channels and how to find them
Detecting Jacobian sparsity patterns by Bayesian probing
Relaxations of factorable functions with convex-transformable intermediates
Polynomial algorithms for a class of linear programs
Matrix factorizations in optimization of nonlinear functions subject to linear constraints
An improved semidefinite programming relaxation for the satisfiability problem
Ergodicity and symmetric mathematical programs
A relaxed projection method for variational inequalities
Regularity estimates for convex multifunctions
Monotone operator theory in convex optimization
Decomposition through formalization in a product space
Robust global optimization with polynomials
Finite-Dimensional Variational Inequality and Nonlinear Complementarity Problems: A Survey of Theory, Algorithms and Applications
Approximate cone factorizations and lifts of polytopes
Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification
On a Subproblem of Trust Region Algorithms for Constrained Optimization
A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
Bound constrained quadratic programming via piecewise quadratic functions
Structure of a simple scheduling polyhedron
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
A simplex based algorithm to solve separated continuous linear programs
Experiments in mixed-integer linear programming
An ellipsoid algorithm for nonlinear programming
Subdifferential characterization of approximate convexity: the lower semicontinuous case
Nominations for Treasurer and Council
Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
An algorithm for determining all extreme points of a convex polytope
On the worst case performance of the steepest descent algorithm for quadratic functions
Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition
Hardness and approximation of submodular minimum linear ordering problems
A note on quadratic forms
Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
Condition numbers and error bounds in convex programming
Aggregation-based cutting-planes for packing and covering integer programs
On the complexity analysis of randomized block-coordinate descent methods
Estimation of sparse hessian matrices and graph coloring problems
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Separation routine and extended formulations for the stable set problem in claw-free graphs
On the resolution of cross-liabilities
A trust region method based on interior point techniques for nonlinear programming
Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs
Accelerated-gradient-based generalized Levenberg-Marquardt method with oracle complexity bound and local quadratic convergence
A trust region algorithm with a worst-case iteration complexity of O(ϵ -3/2 ) for nonconvex optimization
Popular branchings and their dual certificates
Two pairs of families of polyhedral norms versus ℓ p -norms: proximity and applications in optimization
Approximate Quasi-Newton Methods
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates
Optimality conditions for quadratic programming
General bounds for incremental maximization
A practicable steepest-edge simplex algorithm
On some characterisations of totally unimodular matrices
Extreme functions with an arbitrary number of slopes
A class of "onto" multifunctions
Smooth minimization of non-smooth functions
Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
Cutting planes for mixed-integer knapsack polyhedra
MIDAS: A mixed integer dynamic approximation scheme
On the Lipschitzian properties of polyhedral multifunctions
Feasible methods for nonconvex nonsmooth problems with applications in green communications
Solving symmetric indefinite systems in an interior-point method for linear programming
Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
Accelerating the cubic regularization of Newton's method on convex problems
Large-scale linear programming techniques for the design of protein folding potentials
Speed-robust scheduling: sand, bricks, and rocks
Conditioning of convex piecewise linear stochastic programs
Lopsided convergence: an extension and its quantification
Analysis of biased stochastic gradient descent using sequential semidefinite programs
A finite algorithm for the continuous p -center location problem on a graph
On the strength of Lagrangian duality in multiobjective integer programming
Minimum-perimeter domain assignment
Decreasing minimization on M-convex sets: algorithms and applications
Numerical optimization for symmetric tensor decomposition
Linear programming with multiple objective functions: Step method (stem)
Design and verify: a new scheme for generating cutting-planes
Descent methods for composite nondifferentiable optimization problems
An accelerated central cutting plane algorithm for linear semi-infinite programming
Bounds for aggregating nodes in network problems
No-gap second-order optimality conditions for optimal control problems with a single state constraint and control
A framework for generalized Benders' decomposition and its application to multilevel optimization
Balanced matrices
Verifiable conditions of ℓ 1 -recovery for sparse signals with sign restrictions
Analysis of mathematical programming problems prior to applying the simplex algorithm
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
Open versus closed loop capacity equilibria in electricity markets under perfect and oligopolistic competition
On representing the positive semidefinite cone using the second-order cone
Error Bounds for Eigenvalue and Semidefinite Matrix Inequality Systems
Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
Successive column correction algorithms for solving sparse nonlinear systems of equations
A Gauss-Newton method for convex composite optimization
Softmax policy gradient methods can take exponential time to converge
First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
A note on a characterization of P-matrices
Quadratically constrained minimum cross-entropy analysis
High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms
Total dual dyadicness and dyadic generating sets
Automatic Dantzig-Wolfe reformulation of mixed integer programs
Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
Solving semidefinite-quadratic-linear programs using SDPT3
The feasibility pump
A new variable dimension algorithm for the fixed point problem
Mixing MIR inequalities with two divisible coefficients
Strong LP formulations for scheduling splittable jobs on unrelated machines
Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
On the convex hull of convex quadratic optimization problems with indicators
Separating plane algorithms for convex optimization
Subdifferentiation of integral functionals
Presolving in linear programming
Predictor-corrector algorithm for solving P * (k)-matrix LCP from arbitrary positive starting points
Regularization of differential variational inequalities with locally prox-regular sets
On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
A saddle-point characterization of Pareto optima
Complexity bounds for primal-dual methods minimizing the model of objective function
Centrality of trees for capacitated k-center
Coefficient reduction for inequalities in 0-1 variables
On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
Solving multistage asset investment problems by the sample average approximation method
Semiglobal exponential stability of the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm for constrained optimization
The continuous collapsing Knapsack problem
Sensitivity analysis for the asymmetric network equilibrium problem
The range of the efficient frontier in multiple objective linear programming
Solving discrete zero point problems
Shapes and recession cones in mixed-integer convex representability
A note on 'monotone optimal policies for markov decision processes'
K-adaptability in stochastic optimization
A branch and bound method for stochastic global optimization
Proximity bounds for random integer programs
Deriving robust counterparts of nonlinear uncertain inequalities
Polarized consensus-based dynamics for optimization and sampling
Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021
Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
A new inexact alternating directions method for monotone variational inequalities
Power, prices, and incomes in voting systems
An interactive weighted Tchebycheff procedure for multiple objective programming
Practical inexact proximal quasi-Newton method with global complexity analysis
A network simplex method
On the linear convergence rates of exchange and continuous methods for total variation minimization
Composite proximal bundle method
On the computation of equilibria in monotone and potential stochastic hierarchical games
Testing optimality for quadratic 0-1 problems
Distances between optimal solutions of mixed-integer programs
An efficient characterization of submodular spanning tree games
Superlinear convergence of the affine scaling algorithm
The traveling salesman problem in graphs with some excluded minors
Calmness of constraint systems with applications
An optimal adaptive algorithm for the approximation of concave functions
Symmetric indefinite systems for interior point methods
A branch-and-cut algorithm for the Undirected Rural Postman Problem
Conic mixed-integer rounding cuts
Achieving consistency with cutting planes
Computational aspects of two-segment separable programming
Generalized decision rule approximations for stochastic programming via liftings
An online convex optimization-based framework for convex bilevel optimization
Fractional programming without differentiability
Co-NP-completeness of some matrix classification problems
An extended algorithm for separated continuous linear programs
Ellipsoids that Contain All the Solutions of a Positive Semi-Definite Linear Complementarity Problem
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
Penalty function versus non-penalty function methods for constrained nonlinear programming problems
Fractional covers for forests and matchings
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
Packing circuits in matroids
Near-linear convergence of the Random Osborne algorithm for Matrix Balancing
Perturbed Fenchel duality and first-order methods
Separation, dimension, and facet algorithms for node flow polyhedra
A note on the split rank of intersection cuts
Greedy splitting algorithms for approximating multiway partition problems
A modified Weiszfeld algorithm for the Fermat-Weber location problem
On the average number of steps of the simplex method of linear programming
Convergent upper bounds in global minimization with nonlinear equality constraints
Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
Largest dual ellipsoids inscribed in dual cones
On bilevel programming, Part I: General nonlinear cases
A PTAS for the horizontal rectangle stabbing problem
Inclusion functions and global optimization II
Facets and lifting procedures for the set covering polytope
A bound for the number of different basic solutions generated by the simplex method
Computation of equilibria in an economy with increasing returns to scale technologies
Terracini convexity
Exact penalty functions and stability in locally Lipschitz programming
Proximate linear programming: A variable extreme point method
Corner Polyhedra and their connection with cutting planes
Mixing convex-optimization bounds for maximum-entropy sampling
Combinatorial relaxation algorithm for mixed polynomial matrices
Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
Set packing relaxations of some integer programs
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
On optimality conditions for structured families of nonlinear programming problems
Determining GUB sets via an invert agenda algorithm
Maximizing products of linear forms, and the permanent of positive semidefinite matrices
Characterizations of mixed binary convex quadratic representable sets
The volume algorithm: producing primal solutions with a subgradient method
Binary integer programs with two variables per inequality
A superquadratic infeasible-interior-point method for linear complementarity problems
Local behavior of an iterative framework for generalized equations with nonisolated solutions
Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system
A computational status update for exact rational mixed integer programming
Totally balanced combinatorial optimization games
Multi-stage stochastic optimization applied to energy planning
Solving linear programs with finite precision: I. Condition numbers and random programs
On unions and dominants of polytopes
The design centering problem as a D.C. programming problem
Calmness modulus of fully perturbed linear programs
Implementation and efficiency of Moore-algorithms for the shortest route problem
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
Stochastic packing integer programs with few queries
Erratum to: Threshold Boolean form for joint probabilistic constraints with random technology matrix
Combining phase I and phase II in a potential reduction algorithm for linear programming
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
Using cutting planes to solve the symmetric Travelling Salesman problem
A row-action method for convex programming
Sequential quadratic programming for certain parameter identification problems
Partitions into odd chains
Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
Random inequality constraint systems with few variables
Plant location with minimum inventory
Hierarchical partition - a new optimal pivoting algorithm
Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence
A cone programming approach to the bilinear matrix inequality problem and its geometry
Dynamic probabilistic constraints under continuous random distributions
A cutting plane algorithm for convex programming that uses analytic centers
Some branch and bound techniques for nonlinear optimization
Robust multicategory support matrix machines
A family of projective splitting methods for the sum of two maximal monotone operators