A two-parametric class of merit functions for the second-order cone complementarity problem (Q364429): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(9 intermediate revisions by 7 users not shown) | |||
Property / author | |||
Property / author: Zhong-Ping Wan / rank | |||
Property / author | |||
Property / author: Zhong-Ping Wan / rank | |||
Normal rank | |||
Property / review text | |||
Summary: We propose a two-parametric class of merit functions for the second-order cone complementarity problem (SOCCP) based on the one-parametric class of complementarity functions. By the new class of merit functions, the SOCCP can be reformulated as an unconstrained minimization problem. The new class of merit functions is shown to possess some favorable properties. In particular, it provides a global error bound if \(F\) and \(G\) have the joint uniform Cartesian \(P\)-property. And it has bounded level sets under a weaker condition than the most available conditions. Some preliminary numerical results for solving the SOCCPs show the effectiveness of the merit function method via the new class of merit functions. | |||
Property / review text: Summary: We propose a two-parametric class of merit functions for the second-order cone complementarity problem (SOCCP) based on the one-parametric class of complementarity functions. By the new class of merit functions, the SOCCP can be reformulated as an unconstrained minimization problem. The new class of merit functions is shown to possess some favorable properties. In particular, it provides a global error bound if \(F\) and \(G\) have the joint uniform Cartesian \(P\)-property. And it has bounded level sets under a weaker condition than the most available conditions. Some preliminary numerical results for solving the SOCCPs show the effectiveness of the merit function method via the new class of merit functions. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C33 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6206820 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
unconstrained minimization problem | |||
Property / zbMATH Keywords: unconstrained minimization problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
global error bound | |||
Property / zbMATH Keywords: global error bound / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59003055 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SCCP / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: LBFGS-B / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/571927 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2137137155 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applications of second-order cone programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interior point methods for second-order cone programming and OR applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Second-order cone programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Smoothing Functions for Second-Order-Cone Complementarity Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4906119 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new one-step smoothing newton method for the second-order cone complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new one-step smoothing Newton method for second-order cone programming. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An unconstrained smooth minimization reformulation of the second-order cone complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three classes of merit functions for the complementarity problem over a closed convex cone / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A one-parametric class of merit functions for the second-order cone complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two classes of merit functions for the second-order cone complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4321748 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5479900 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A one-parametric class of merit functions for the symmetric cone complementarity problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Limited Memory Algorithm for Bound Constrained Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Nonmonotone Line Search Technique for Newton’s Method / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:09, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A two-parametric class of merit functions for the second-order cone complementarity problem |
scientific article |
Statements
A two-parametric class of merit functions for the second-order cone complementarity problem (English)
0 references
9 September 2013
0 references
Summary: We propose a two-parametric class of merit functions for the second-order cone complementarity problem (SOCCP) based on the one-parametric class of complementarity functions. By the new class of merit functions, the SOCCP can be reformulated as an unconstrained minimization problem. The new class of merit functions is shown to possess some favorable properties. In particular, it provides a global error bound if \(F\) and \(G\) have the joint uniform Cartesian \(P\)-property. And it has bounded level sets under a weaker condition than the most available conditions. Some preliminary numerical results for solving the SOCCPs show the effectiveness of the merit function method via the new class of merit functions.
0 references
unconstrained minimization problem
0 references
global error bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references