Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method
Data up to Jan 2025
Total Citations Per Year
Abstract
References (104)
Linear Matrix Inequalities in System and Control Theory
1994 • 20,910 citations
Data networks
1987 • 5,740 citations
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
Interior-Point Polynomial Algorithms in Convex Programming
1994 • 4,212 citations
Partitioning procedures for solving mixed-variables programming problems
1962 • 3,587 citations
Convex analysis and minimization algorithms
1993 • 2,552 citations
Introductory Lectures on Convex Optimization
2004 • 2,463 citations
Decomposition Principle for Linear Programs
1960 • 2,224 citations
The Lagrangian Relaxation Method for Solving Integer Programming Problems
1981 • 2,035 citations
A Linear Programming Approach to the Cutting-Stock Problem
1961 • 1,976 citations
Problem complexity and method efficiency in optimization
1984 • 1,542 citations
The Cutting-Plane Method for Solving Convex Programs
1960 • 1,530 citations
The Traveling-Salesman Problem and Minimum Spanning Trees
1970 • 1,431 citations
Validation of subgradient optimization
1974 • 1,360 citations
Optimization Theory for Large Systems
1970 • 1,265 citations
Linear controller design: limits of performance
1991 • 1,234 citations
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
1969 • 1,224 citations
Minimization Methods for Non-Differentiable Functions
1985 • 1,213 citations
A Linear Programming Approach to the Cutting Stock Problem—Part II
1963 • 1,088 citations
Lagrangean relaxation for integer programming
1974 • 1,056 citations
The traveling-salesman problem and minimum spanning trees: Part II
1971 • 1,010 citations
Minimization methods for non-differentiable functions
1985 • 1,005 citations
Lagrangian Relaxation for Integer Programming
2009 • 996 citations
Interior Point Algorithms
1997 • 935 citations
The Decomposition Algorithm for Linear Programs
1961 • 754 citations
Another proof of the defect relation for moving targets
1991 • 643 citations
Nonlinear Programming.
1968 • 602 citations
The flow deviation method: An approach to store‐and‐forward communication network design
1973 • 566 citations
Minimization of unsmooth functionals
1969 • 560 citations
Theory and algorithms for linear optimization : an interior point approach
1997 • 522 citations
Methods of Descent for Nondifferentiable Optimization
1985 • 398 citations
Convex Analysis and Minimization Algorithms II
1993 • 395 citations
New variants of bundle methods
1995 • 390 citations
Methods of Descent for Nondifferentiable Optimization
1985 • 387 citations
A method of conjugate subgradients for minimizing nondifferentiable functions
1975 • 380 citations
Mathematical Programming
1995 • 353 citations
Newton's method for convex programming and Tchebycheff approximation
1959 • 335 citations
A Suggested Computation for Maximal Multi-Commodity Network Flows
1958 • 304 citations
Nondifferentiable Optimization and Polynomial Problems
1998 • 265 citations
Optimisation : méthodes numériques
1976 • 219 citations
Decomposition and Nondifferentiable Optimization with the Projective Algorithm
1992 • 203 citations
Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
1982 • 196 citations
A Survey of Lagrangean Techniques for Discrete Optimization
1979 • 177 citations
A Survey of Algorithms for Convex Multicommodity Flow Problems
2000 • 154 citations
On the complexity of approximating the maximal inscribed ellipsoid for a polytope
1993 • 152 citations
A new algorithm for minimizing convex functions over convex sets
1996 • 151 citations
Nondifferentiable optimization
1989 • 141 citations
A polynomial newton method for linear programming
1986 • 138 citations
A central cutting plane algorithm for the convex programming problem
1975 • 129 citations
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
1996 • 126 citations
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
1997 • 121 citations
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
1999 • 108 citations
Multicommodity network flows: The impact of formulation on decomposition
1993 • 106 citations
Complexity estimates of some cutting plane methods based on the analytic barrier
1995 • 97 citations
Warm start of the primal-dual method applied in the cutting-plane scheme
1998 • 94 citations
Solving combinatorial optimization problems using Karmarkar's algorithm
1992 • 81 citations
A cutting plane method from analytic centers for stochastic programming
1995 • 79 citations
Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm
2000 • 76 citations
New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation
1988 • 74 citations
A Potential Reduction Algorithm Allowing Column Generation
1992 • 73 citations
Computational Experience with an Interior Point Cutting Plane Algorithm
2000 • 70 citations
An interior-point/cutting-plane method to solve unit commitment problems
2000 • 68 citations
New variants of bundle methods
1995 • 60 citations
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm
1993 • 59 citations
Complexity analysis of the analytic center cutting plane method that uses multiple cuts
1996 • 58 citations
ACCPM — A library for convex optimization based on an analytic center cutting plane method
1996 • 56 citations
The integration of an interior-point cutting plane method within a branch-and-price algorithm
2004 • 50 citations
Bounded error parameter estimation: a sequential analytic center approach
1999 • 48 citations
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities
1999 • 48 citations
Multiple Cuts in the Analytic Center Cutting Plane Method
2000 • 47 citations
A new proximal decomposition algorithm for routing in telecommunication networks
1998 • 46 citations
Shallow, deep and very deep cuts in the analytic center cutting plane method
1999 • 43 citations
Untitled
1998 • 37 citations
An Analytic Center Based Column Generation Algorithm for Convex Quadratic Feasibility Problems
1998 • 32 citations
Untitled
1997 • 30 citations
Untitled
1999 • 28 citations
A logarithmic barrier cutting plane method for convex programming
1995 • 28 citations
Using an interior point method for the master problem in a decomposition approach
1997 • 25 citations
Towards a Practical Volumetric Cutting Plane Method for Convex Programming
1998 • 25 citations
Adaptive linear filtering using interior point optimization techniques
2000 • 24 citations
A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm
2000 • 23 citations
A Short-Cut Potential Reduction Algorithm for Linear Programming
1993 • 23 citations
A note on some analytic center cutting plane methods for convex feasibility and minimization problems
1996 • 22 citations
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
1999 • 22 citations
A Structure-Exploiting Tool in Algebraic Modeling Languages
2000 • 21 citations
Untitled
1998 • 21 citations
The Analytic Center Quadratic Cut Method for Strongly Monotone Variational Inequality Problems
2000 • 18 citations
Untitled
2000 • 18 citations
A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
1998 • 18 citations
Untitled
1999 • 15 citations
The decomposition principle and algorithms for linear programming
1991 • 15 citations
Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
1997 • 14 citations
Untitled
2000 • 14 citations
Homogeneous analytic center cutting plane methods with approximate centers
1999 • 12 citations
Untitled
1999 • 10 citations
An analytic center quadratic cut method for the convex quadratic feasibility problem
2002 • 9 citations
Telecommunications networks routing and survivability optimization using a central cutting plane method
1998 • 8 citations
Structure Exploiting Tool in Algebraic Modeling Languages
1997 • 6 citations
An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
1997 • 6 citations
A Homogenized Cutting Plane Method to Solve the Convex Feasibility Problem
2001 • 5 citations
Interior point least squares estimation: transient convergence analysis and application to MMSE decision-feedback equalization
2001 • 5 citations
A Planning Model with one Million Scenarios Solved on an Affordable Parallel Machine
1998 • 4 citations
Homegeneous analytic center cutting plane methods for convex problems and variational inequalities
1997 • 4 citations
Multicoordination Methods for Solving Convex Block-Angular Programs
1999 • 3 citations