scientific article; zbMATH DE number 1131479
From MaRDI portal
Publication:4382667
zbMath0943.90070MaRDI QIDQ4382667
Publication date: 22 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
optimization problemsasymptotic analysisinterior point algorithmsinterior point methodsworst-case complexityaverage case analysiseffective implementation
Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure., Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, An optimal approach for the critical node problem using semidefinite programming, A level set approach for the solution of a state-constrained optimal control problem, A fixed point iterative approach to integer programming and its distributed computation, An extension of interior point potential reduction algorithm to solve general lcps, A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron, An efficient fifth-order method for linear optimization, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term, A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood, Infeasible interior-point methods for linear optimization based on large neighborhood, Representing the space of linear programs as the Grassmann manifold, Mathematical programming approaches for classes of random network problems, Improved branching disjunctions for branch-and-bound: an analytic center approach, Fuzzy goal programming: complementary slackness conditions and computational schemes, An interior-point algorithm for semidefinite least-squares problems., Scheduling under linear constraints, A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization, A new path-following algorithm for nonlinear \(P_*\) complementarity problems, A logarithmic barrier approach for linear programming, Recursive central rounding for mixed integer programs, Optimal scaling of a gradient method for distributed resource allocation, A polynomial-time solution scheme for quadratic stochastic programs, A logarithmic barrier interior-point method based on majorant functions for second-order cone programming, Approximation accuracy, gradient methods, and error bound for structured convex optimization, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, Bin packing under linear constraints, A novel non-linear approach to minimal area rectangular packing, On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming, Existence, uniqueness, and convergence of the regularized primal-dual central path, Knapsack with variable weights satisfying linear constraints, A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization, CVXGEN: a code generator for embedded convex optimization, Autonomous trajectory planning for space vehicles with a Newton-Kantorovich/convex programming approach, The multiproximal linearization method for convex composite problems, A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps, An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization, A new class of copulas involved geometric distribution: estimation and applications, An adaptive-step primal-dual interior point algorithm for linear optimization, An interior point cutting plane heuristic for mixed integer programming, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, Hybrid regularization methods for seismic reflectivity inversion, A note on the complexity of \(L _{p }\) minimization, Primal and dual linear decision rules in stochastic and robust optimization, Probabilistic analysis of a differential equation for linear programming, Specialized fast algorithms for IQC feasibility and optimization problems., The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, A study of the dual affine scaling continuous trajectories for linear programming, Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs, A convex relaxation bound for subgraph isomorphism, A modified infeasible-interior-point algorithm for linear optimization problems, Parabolic target space and primal-dual interior-point methods, Improved bounds on the energy-minimizing strains in martensitic polycrystals, George B. Dantzig and systems optimization, Second-order cone interior-point method for quasistatic and moderate dynamic cohesive fracture, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, A non-interior-point smoothing method for variational inequality problem, A mixed 0--1 LP for index tracking problem with CVaR risk constraints, A survey on the high convergence orders and computational convergence orders of sequences, The asymptotic optimal partition and extensions of the nonsubstitution theorem, On self-regular IPMs (with comments and rejoinder), ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements, A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization, Linear operators and positive semidefiniteness of symmetric tensor spaces, An interior-point algorithm for linear optimization based on a new barrier function, An efficient parameterized logarithmic kernel function for linear optimization, New method for determining search directions for interior-point algorithms in linear optimization, Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, Lower-order penalization approach to nonlinear semidefinite programming, Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions, Note on implementing the new sphere method for LP using matrix inversions sparingly, A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound, Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function, A redundant Klee-Minty construction with all the redundant constraints touching the feasible region, Space tensor conic programming, A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO, A wide neighborhood interior-point algorithm based on the trigonometric kernel function, An interior-point algorithm for linear programming with optimal selection of centering parameter and step size, Partitioning multiple objective optimal solutions with applications in radiotherapy design, An infeasible interior-point arc-search algorithm for nonlinear constrained optimization, A primal-dual interior point method for parametric semidefinite programming problems, An efficient twice parameterized trigonometric kernel function for linear optimization, A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem, Stabilized column generation, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Analytic centers and repelling inequalities, Interior-point methods, An SQP method for general nonlinear complementarity problems, A new algorithm for geometric programming based on the linear structure of its dual problem., Pivot versus interior point methods: Pros and cons, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, On a solution method in indefinite quadratic programming under linear constraints, An overview of nonlinear optimization, A new search direction for full-Newton step infeasible interior-point method in linear optimization, A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints, Unnamed Item, Unnamed Item, A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function, A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix, A new infeasible interior-point algorithm with full step for linear optimization based on a simple function, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, Extreme points of well-posed polytopes, Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly, A still simpler way of introducing interior-point method for linear programming, A globally convergent regularized interior point method for constrained optimization, Diameter and Curvature: Intriguing Analogies, Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming, Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications, Random matrix theory for the analysis of the performance of an analog computer: a scaling theory, An adaptive self-regular proximity-based large-update IPM for LO, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, A new primal-dual interior-point algorithm for convex quadratic optimization, The interior-point revolution in optimization: History, recent developments, and lasting consequences, Two wide neighborhood interior-point methods for symmetric cone optimization, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, An L p Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model, A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils, Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data, On the chaotic behavior of the primal–dual affine–scaling algorithm for linear optimization, Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming‐Based Approach, Development of fuzzy probability based random fields for the numerical structural design, On a box-constrained linear symmetric cone optimization problem, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, The Chebyshev center as an alternative to the analytic center in the feasibility pump, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, A corrector-predictor interior-point method with new search direction for linear optimization, Hardness Results for Structured Linear Systems, Optimal experimental design and some related control problems, A cutting plane method for solving KYP-SDPs, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, A potential-reduction algorithm for linear complementarity problems, A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization, A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Combined interior-point method and semismooth Newton method for frictionless contact problems, A framework for solving mixed-integer semidefinite programs, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, An infeasible interior-point algorithm with full-Newton step for linear optimization, Dual versus primal-dual interior-point methods for linear and conic programming, Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming, Complexity of general continuous minimization problems: a survey, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Interior Point Methods for Nonlinear Optimization, A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems, An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization, A self-adjusting primal–dual interior point method for linear programs, An easy way to teach interior-point methods., Dual–primal algorithm for linear optimization, Time-varying minimum cost flow problems, Multistage quadratic stochastic programming, Optimal assignment schemes for general access structures based on linear programming, Learning utility functions from preference relations on graphs, A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP, Iterative solution methods for mesh approximation of control and state constrained optimal control problem with observation in a part of the domain, A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, A constraint generation algorithm for large scale linear programs using multiple-points separation, A dynamic large-update primal‐dual interior-point method for linear optimization, Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function, New algorithm for the conical combination representation problem of a vector, A general class of penalty/barrier path-following Newton methods for nonlinear programming, SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps, Tensor complementarity problems. II: Solution methods, Fast linear iterations for distributed averaging, Complexity of some inverse shortest path lengths problems, Approximate augmented Lagrangian functions and nonlinear semidefinite programs, On the approximability of the two-phase knapsack problem, The complexity of self-regular proximity based infeasible IPMs, Computational methods for solving fully fuzzy linear systems, An oracle for the discrete-time integral quadratic constraint problem, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function, A predictor-corrector algorithm for linear optimization based on a modified Newton direction, A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming, Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization, Some graph optimization problems with weights satisfying linear constraints, Simplified infeasible interior-point algorithm for linear optimization based on a simple function, A polynomial-time weighted path-following interior-point algorithm for linear optimization, Matrix-free algorithm for the large-scale constrained trust-region subproblem, A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization, Une procédure de purification pour les problèmes de complémentarité linéaire, monotones, Combined projected gradient algorithm for linear programming, A sequential quadratic penalty method for nonlinear semidefinite programming, A sequential quadratic penalty method for nonlinear semidefinite programming, An ADMM-based interior-point method for large-scale linear programming, Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function, A new portfolio rebalancing model with transaction costs, Generalized affine scaling algorithms for linear programming problems, LFTB: an efficient algorithm to bound linear fractional transformations, An analytic center cutting plane algorithm for finding equilibrium points, An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation, Mixed linear and semidefinite programming for combinatorial and quadratic optimization, On saddle points in semidefinite optimization via separation scheme, An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function, An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs, On the convergence of a predictor-corrector variant algorithm, Path-following interior-point algorithm for monotone linear complementarity problems
Uses Software
