The following pages link to (Q4296156):
Displaying 50 items.
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- Robust identification and control based on ellipsoidal parametric uncertainty descriptions (Q397626) (← links)
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
- \(L^{p}\)-norms, log-barriers and Cramer transform in optimization (Q618872) (← links)
- Constraint consensus methods for finding interior feasible points in second-order cones (Q624763) (← links)
- On convex optimization without convex representation (Q644504) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- An efficient semi-blind source extraction algorithm and its applications to biomedical signal extraction (Q848382) (← links)
- Fuzzy goal programming: complementary slackness conditions and computational schemes (Q849750) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- Actuator fault diagnosis with robustness to sensor distortion (Q983360) (← links)
- Riemannian Newton method for positive bounded Hessian functions (Q997520) (← links)
- Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions (Q1002052) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- Applications of second-order cone programming (Q1124764) (← links)
- Long-step interior-point algorithms for a class of variational inequalities with monotone operators (Q1264995) (← links)
- Proximal methods in view of interior-point strategies (Q1265063) (← links)
- Cost-effective sulphur emission reduction under uncertainty (Q1268422) (← links)
- High resolution pursuit for feature extraction (Q1272847) (← links)
- Long-step primal path-following algorithm for monotone variational inequality problems (Q1275718) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- An interior point method, based on rank-1 updates, for linear programming (Q1290600) (← links)
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- A long-step primal-dual path-following method for semidefinite programming (Q1306474) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← links)
- Infinite-dimensional quadratic optimization: Interior-point methods and control applications (Q1363637) (← links)
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (Q1366422) (← links)
- Inverse barriers and CES-functions in linear programming (Q1374380) (← links)
- Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space (Q1379935) (← links)
- Euclidean Jordan algebras and interior-point algorithms (Q1383772) (← links)
- A general projection framework for constrained smoothing. (Q1431205) (← links)
- Higher-order derivatives in linear and quadratic programming (Q1592581) (← links)
- On the choice of parameters for power-series interior point algorithms in linear programming (Q1804368) (← links)
- On well definedness of the central path (Q1807813) (← links)
- On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← links)
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure. (Q1872636) (← links)
- On controlling the parameter in the logarithmic barrier term for convex programming problems (Q1893461) (← links)
- Potential reduction method for harmonically convex programming (Q1893464) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- Primal-dual target-following algorithms for linear programming (Q1915912) (← links)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming (Q2174912) (← links)
- Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly (Q2371467) (← links)
- Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions (Q2419536) (← links)
- Optimal experimental design and some related control problems (Q2440603) (← links)
- A polynomial time algorithm for Zero-Clairvoyant scheduling (Q2475435) (← links)
- The use of stochastic analytic center for yield maximization of systems with general distributions of component values (Q2477340) (← links)
- Deriving robust counterparts of nonlinear uncertain inequalities (Q2515042) (← links)
