Pages that link to "Item:Q3830821"
From MaRDI portal
The following pages link to The Projective SUMT Method for Convex Programming (Q3830821):
Displaying 20 items.
- Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm (Q257838) (← links)
- Homotopy interior-point method for a general multiobjective programming problem (Q442940) (← links)
- Legendre transform and applications to finite and infinite optimization (Q505632) (← links)
- On the complexity of a combined homotopy interior method for convex programming (Q859861) (← links)
- Homotopy method for a general multiobjective programming problem (Q937132) (← links)
- A globally convergent interior point algorithm for non-convex nonlinear programming (Q1002202) (← links)
- On some efficient interior point methods for nonlinear convex programming (Q1174840) (← links)
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT (Q1316100) (← links)
- Rank-one techniques in log-barrier function methods for linear programming (Q1333365) (← links)
- Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204) (← links)
- A combined homotopy interior point method for general nonlinear programming problems (Q1354287) (← links)
- A combined homotopy interior point method for convex nonlinear programming (Q1368923) (← links)
- A noninterior path following algorithm for solving a class of multiobjective programming problems (Q1719236) (← links)
- A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879) (← links)
- A homotopy method for solving bilevel programming problem (Q1881333) (← links)
- Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition (Q1925395) (← links)
- A polynomial path following algorithm for convex programming (Q2479155) (← links)
- Perturbed variations of penalty function methods. Example: Projective SUMT (Q2639773) (← links)
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints (Q3177632) (← links)
- Inertial Game Dynamics and Applications to Constrained Optimization (Q3195290) (← links)
